./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:36:58,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:36:58,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:36:58,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:36:58,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:36:58,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:36:58,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:36:58,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:36:58,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:36:58,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:36:58,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:36:58,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:36:58,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:36:58,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:36:58,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:36:58,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:36:58,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:36:58,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:36:58,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:36:58,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:36:58,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:36:58,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:36:58,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:36:58,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:36:58,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:36:58,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:36:58,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:36:58,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:36:58,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:36:58,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:36:58,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:36:58,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:36:58,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:36:58,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:36:58,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:36:58,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:36:58,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:36:58,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:36:58,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:36:58,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:36:58,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:36:58,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:36:58,397 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:36:58,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:36:58,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:36:58,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:36:58,399 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:36:58,400 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:36:58,400 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:36:58,400 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:36:58,401 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:36:58,401 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:36:58,401 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:36:58,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:36:58,402 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:36:58,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:36:58,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:36:58,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:36:58,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:36:58,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:36:58,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:36:58,404 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:36:58,404 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:36:58,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:36:58,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:36:58,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:36:58,405 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:36:58,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:36:58,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:36:58,406 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:36:58,406 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:36:58,408 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:36:58,408 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf [2020-07-29 01:36:58,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:36:58,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:36:58,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:36:58,734 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:36:58,735 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:36:58,736 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2020-07-29 01:36:58,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce62236a8/0de69b0a86374c098eca23ba6f082095/FLAG0e0ca6243 [2020-07-29 01:36:59,356 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:36:59,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2020-07-29 01:36:59,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce62236a8/0de69b0a86374c098eca23ba6f082095/FLAG0e0ca6243 [2020-07-29 01:36:59,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce62236a8/0de69b0a86374c098eca23ba6f082095 [2020-07-29 01:36:59,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:36:59,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:36:59,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:36:59,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:36:59,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:36:59,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:36:59" (1/1) ... [2020-07-29 01:36:59,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1311cf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:59, skipping insertion in model container [2020-07-29 01:36:59,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:36:59" (1/1) ... [2020-07-29 01:36:59,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:36:59,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:37:00,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:00,271 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:37:00,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:00,406 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:37:00,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00 WrapperNode [2020-07-29 01:37:00,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:00,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:00,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:37:00,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:37:00,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (1/1) ... [2020-07-29 01:37:00,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (1/1) ... [2020-07-29 01:37:00,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:00,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:37:00,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:37:00,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:37:00,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (1/1) ... [2020-07-29 01:37:00,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (1/1) ... [2020-07-29 01:37:00,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (1/1) ... [2020-07-29 01:37:00,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (1/1) ... [2020-07-29 01:37:00,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (1/1) ... [2020-07-29 01:37:00,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (1/1) ... [2020-07-29 01:37:00,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (1/1) ... [2020-07-29 01:37:00,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:37:00,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:37:00,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:37:00,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:37:00,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:37:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:37:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:37:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:37:00,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:37:00,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:37:00,968 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:37:00,969 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:37:00,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:00 BoogieIcfgContainer [2020-07-29 01:37:00,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:37:00,972 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:37:00,973 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:37:00,976 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:37:00,977 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:00,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:36:59" (1/3) ... [2020-07-29 01:37:00,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a014168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:00, skipping insertion in model container [2020-07-29 01:37:00,979 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:00,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:00" (2/3) ... [2020-07-29 01:37:00,980 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a014168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:00, skipping insertion in model container [2020-07-29 01:37:00,980 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:00,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:00" (3/3) ... [2020-07-29 01:37:00,982 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-2.i [2020-07-29 01:37:01,032 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:37:01,032 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:37:01,032 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:37:01,033 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:37:01,033 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:37:01,033 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:37:01,033 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:37:01,034 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:37:01,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:37:01,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:37:01,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:01,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:01,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:37:01,086 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:37:01,086 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:37:01,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:37:01,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:37:01,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:01,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:01,091 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:37:01,091 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:37:01,099 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 7#L566true assume !(main_~array_size~0 < 1); 9#L566-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 4#L550-3true [2020-07-29 01:37:01,100 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 12#L554-3true assume !true; 14#L554-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3#L550-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 4#L550-3true [2020-07-29 01:37:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:01,105 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 01:37:01,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:01,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255430551] [2020-07-29 01:37:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:01,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:01,228 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:01,252 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2020-07-29 01:37:01,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:01,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467461856] [2020-07-29 01:37:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:01,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#true} 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; {20#true} is VALID [2020-07-29 01:37:01,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {20#true} assume !true; {21#false} is VALID [2020-07-29 01:37:01,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#false} 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); {21#false} is VALID [2020-07-29 01:37:01,315 INFO L280 TraceCheckUtils]: 3: Hoare triple {21#false} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {21#false} is VALID [2020-07-29 01:37:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:01,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467461856] [2020-07-29 01:37:01,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:01,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:37:01,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803497346] [2020-07-29 01:37:01,329 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:37:01,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:01,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:37:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:37:01,348 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2020-07-29 01:37:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:01,379 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-07-29 01:37:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:37:01,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:37:01,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:01,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2020-07-29 01:37:01,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:37:01,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2020-07-29 01:37:01,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:37:01,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:37:01,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-07-29 01:37:01,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:01,408 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:37:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-07-29 01:37:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:37:01,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:01,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:01,438 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:01,440 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:01,442 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:37:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:37:01,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:01,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:01,445 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:37:01,445 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:37:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:01,447 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:37:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:37:01,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:01,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:01,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:01,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:37:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 01:37:01,452 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:37:01,452 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:37:01,452 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:37:01,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:37:01,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:37:01,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:01,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:01,454 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:37:01,454 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:37:01,455 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 38#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 39#L566 assume !(main_~array_size~0 < 1); 40#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 37#L550-3 [2020-07-29 01:37:01,455 INFO L796 eck$LassoCheckResult]: Loop: 37#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 36#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 37#L550-3 [2020-07-29 01:37:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:01,456 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-07-29 01:37:01,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:01,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527751040] [2020-07-29 01:37:01,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:01,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:01,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:01,518 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:01,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2020-07-29 01:37:01,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:01,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189401964] [2020-07-29 01:37:01,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:01,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {71#true} 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; {73#(<= (+ ULTIMATE.start_SelectionSort_~j~0 1) ULTIMATE.start_SelectionSort_~array_size)} is VALID [2020-07-29 01:37:01,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#(<= (+ ULTIMATE.start_SelectionSort_~j~0 1) ULTIMATE.start_SelectionSort_~array_size)} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {72#false} is VALID [2020-07-29 01:37:01,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {72#false} 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); {72#false} is VALID [2020-07-29 01:37:01,590 INFO L280 TraceCheckUtils]: 3: Hoare triple {72#false} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {72#false} is VALID [2020-07-29 01:37:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:01,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189401964] [2020-07-29 01:37:01,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:01,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:37:01,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140009095] [2020-07-29 01:37:01,592 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:37:01,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:01,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:37:01,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:37:01,593 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:37:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:01,646 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:37:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:37:01,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:37:01,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:01,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2020-07-29 01:37:01,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:37:01,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2020-07-29 01:37:01,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:37:01,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:37:01,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 01:37:01,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:01,662 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:37:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 01:37:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:37:01,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:01,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:37:01,664 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:37:01,664 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:37:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:01,666 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:37:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:37:01,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:01,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:01,667 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 01:37:01,668 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 01:37:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:01,669 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:37:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:37:01,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:01,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:01,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:01,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:37:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-07-29 01:37:01,673 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:37:01,673 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:37:01,673 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:37:01,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:37:01,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:37:01,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:01,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:01,675 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:37:01,676 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:01,676 INFO L794 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 87#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; 88#L566 assume !(main_~array_size~0 < 1); 89#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 86#L550-3 [2020-07-29 01:37:01,676 INFO L796 eck$LassoCheckResult]: Loop: 86#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 91#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 94#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 92#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 93#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 95#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 85#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 86#L550-3 [2020-07-29 01:37:01,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:01,677 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2020-07-29 01:37:01,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:01,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472746165] [2020-07-29 01:37:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:01,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:01,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:01,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:01,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:01,706 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2020-07-29 01:37:01,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:01,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540969859] [2020-07-29 01:37:01,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:01,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:01,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:01,752 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:01,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2020-07-29 01:37:01,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:01,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448395516] [2020-07-29 01:37:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:01,781 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:01,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:01,817 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:02,029 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-07-29 01:37:02,272 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-07-29 01:37:02,379 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:02,380 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:02,380 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:02,380 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:02,380 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:02,381 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:02,381 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:02,381 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:02,381 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration3_Lasso [2020-07-29 01:37:02,381 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:02,382 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:02,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,623 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-07-29 01:37:02,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:02,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:03,529 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:03,536 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:03,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:03,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:03,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:03,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:03,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:03,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:03,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:03,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:03,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:03,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:03,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:03,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:03,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:03,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:03,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:03,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:03,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:03,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:03,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:03,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:03,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:03,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:03,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:03,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:03,725 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:03,807 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-07-29 01:37:03,807 INFO L444 ModelExtractionUtils]: 12 out of 40 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:03,851 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:03,869 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:37:03,870 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:03,871 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_#in~array_size) = -1*ULTIMATE.start_SelectionSort_~i~0 + 1*ULTIMATE.start_SelectionSort_#in~array_size Supporting invariants [1*ULTIMATE.start_SelectionSort_~a.offset - 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1 + 4*ULTIMATE.start_SelectionSort_#in~array_size >= 0] [2020-07-29 01:37:03,936 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:37:03,945 INFO L393 LassoCheck]: Loop: "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;" "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);" "assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0;" "SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3;" "assume !(SelectionSort_~j~0 < SelectionSort_~array_size);" "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);" "SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2;" [2020-07-29 01:37:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:04,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:04,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:37:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:04,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:04,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {127#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {127#unseeded} is VALID [2020-07-29 01:37:04,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {127#unseeded} 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; {127#unseeded} is VALID [2020-07-29 01:37:04,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {127#unseeded} assume !(main_~array_size~0 < 1); {127#unseeded} is VALID [2020-07-29 01:37:04,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {127#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {161#(and (>= (+ ULTIMATE.start_SelectionSort_~a.offset (* (- 1) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|)) 0) unseeded)} is VALID [2020-07-29 01:37:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:04,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:37:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:04,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:04,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {162#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~i~0) |ULTIMATE.start_SelectionSort_#in~array_size|)) (>= (+ ULTIMATE.start_SelectionSort_~a.offset (* (- 1) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|)) 0))} 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; {179#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~j~0) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:37:04,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {179#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~j~0) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} 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); {183#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (- 4)) 4)) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:37:04,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {183#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (- 4)) 4)) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {183#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (- 4)) 4)) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:37:04,185 INFO L280 TraceCheckUtils]: 3: Hoare triple {183#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (- 4)) 4)) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {183#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (- 4)) 4)) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:37:04,187 INFO L280 TraceCheckUtils]: 4: Hoare triple {183#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (- 4)) 4)) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {183#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (- 4)) 4)) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:37:04,188 INFO L280 TraceCheckUtils]: 5: Hoare triple {183#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (- 4)) 4)) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} 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); {183#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (- 4)) 4)) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:37:04,190 INFO L280 TraceCheckUtils]: 6: Hoare triple {183#(and (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ ULTIMATE.start_SelectionSort_~a.offset (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (- 4)) 4)) (<= |ULTIMATE.start_SelectionSort_#in~array_size| (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {164#(and (>= (+ ULTIMATE.start_SelectionSort_~a.offset (* (- 1) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (* 4 |ULTIMATE.start_SelectionSort_#in~array_size|)) 0) (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~i~0) |ULTIMATE.start_SelectionSort_#in~array_size|)) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:37:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:04,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:04,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:04,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:37:04,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,224 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 [2020-07-29 01:37:04,225 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 01:37:04,417 INFO L75 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. [2020-07-29 01:37:04,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:04,418 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:04,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 4 [2020-07-29 01:37:04,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:04,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:04,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:37:04,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:04,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:04,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:04,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-07-29 01:37:04,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:04,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:04,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:04,429 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 4 [2020-07-29 01:37:04,431 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:37:04,432 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:37:04,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:04,434 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:04,434 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:04,435 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:04,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:37:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:37:04,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:37:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:04,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:04,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:04,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:37:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:37:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:37:04,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:04,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:04,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:37:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:37:04,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:37:04,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:37:04,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:37:04,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:37:04,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:04,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:04,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:04,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:04,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:04,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:04,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:04,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:04,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:04,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:04,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:04,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:04,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:37:04,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:37:04,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:37:04,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:04,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:04,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:04,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:04,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:04,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:04,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:04,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:04,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:04,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:04,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:04,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:04,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,462 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:37:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:37:04,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:37:04,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:37:04,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2020-07-29 01:37:04,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:04,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:04,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:04,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2020-07-29 01:37:04,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:37:04,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:37:04,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-07-29 01:37:04,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:04,470 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:37:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-07-29 01:37:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-29 01:37:04,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:04,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand 15 states. [2020-07-29 01:37:04,472 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand 15 states. [2020-07-29 01:37:04,472 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 15 states. [2020-07-29 01:37:04,473 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:04,476 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:37:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:37:04,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:04,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:04,478 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states and 22 transitions. [2020-07-29 01:37:04,478 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states and 22 transitions. [2020-07-29 01:37:04,479 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:04,480 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:37:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:37:04,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:04,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:04,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:04,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:37:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-07-29 01:37:04,484 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-29 01:37:04,484 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-29 01:37:04,484 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:37:04,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-07-29 01:37:04,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:04,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:04,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:04,486 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:04,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:04,487 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 230#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; 231#L566 assume !(main_~array_size~0 < 1); 232#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 233#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 235#L554-3 [2020-07-29 01:37:04,487 INFO L796 eck$LassoCheckResult]: Loop: 235#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 240#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 237#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 235#L554-3 [2020-07-29 01:37:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:04,487 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-07-29 01:37:04,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:04,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918490009] [2020-07-29 01:37:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:04,499 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:04,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:04,512 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:04,513 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2020-07-29 01:37:04,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:04,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471883167] [2020-07-29 01:37:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:04,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:04,526 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:04,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:04,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2020-07-29 01:37:04,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:04,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632088712] [2020-07-29 01:37:04,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:04,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:04,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:04,590 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:04,911 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-07-29 01:37:04,990 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:04,991 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:04,991 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:04,991 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:04,991 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:04,991 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:04,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:04,992 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:04,992 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration4_Lasso [2020-07-29 01:37:04,992 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:04,992 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:05,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,203 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-07-29 01:37:05,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:05,987 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:05,987 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:06,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:06,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:06,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:06,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:06,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:06,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:06,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:06,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:06,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:06,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:06,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:06,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:06,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:06,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:06,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:06,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:06,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:06,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:06,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:06,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:06,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:06,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:06,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:06,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:06,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:06,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:06,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:06,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:06,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:06,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:06,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:06,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:06,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:06,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:06,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:06,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:06,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:06,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:06,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:06,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:06,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:06,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:06,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:06,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:06,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:06,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:06,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:06,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:06,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:06,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:06,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:06,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:06,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:06,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:06,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:06,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:06,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:06,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:06,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:06,402 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:06,447 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 01:37:06,447 INFO L444 ModelExtractionUtils]: 20 out of 40 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:06,449 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:37:06,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:37:06,459 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:06,459 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2, ULTIMATE.start_SelectionSort_~a.offset) = -4*ULTIMATE.start_SelectionSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 - 1*ULTIMATE.start_SelectionSort_~a.offset Supporting invariants [] [2020-07-29 01:37:06,509 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:37:06,513 INFO L393 LassoCheck]: Loop: "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);" "assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0;" "SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3;" [2020-07-29 01:37:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:06,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:37:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:06,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:06,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:06,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {322#unseeded} is VALID [2020-07-29 01:37:06,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#unseeded} 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; {322#unseeded} is VALID [2020-07-29 01:37:06,557 INFO L280 TraceCheckUtils]: 2: Hoare triple {322#unseeded} assume !(main_~array_size~0 < 1); {322#unseeded} is VALID [2020-07-29 01:37:06,558 INFO L280 TraceCheckUtils]: 3: Hoare triple {322#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {322#unseeded} is VALID [2020-07-29 01:37:06,559 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#unseeded} 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; {322#unseeded} is VALID [2020-07-29 01:37:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:06,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:06,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:06,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {325#(>= oldRank0 (+ (* (- 4) ULTIMATE.start_SelectionSort_~j~0) (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset)))} 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); {372#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset oldRank0)))} is VALID [2020-07-29 01:37:06,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {372#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset oldRank0)))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {372#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset oldRank0)))} is VALID [2020-07-29 01:37:06,602 INFO L280 TraceCheckUtils]: 2: Hoare triple {372#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset oldRank0)))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {355#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) ULTIMATE.start_SelectionSort_~j~0) (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset)))))} is VALID [2020-07-29 01:37:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:06,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:37:06,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:06,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:06,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,627 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:37:06,627 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:37:06,708 INFO L75 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. [2020-07-29 01:37:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:06,708 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:06,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:06,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:06,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:06,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:37:06,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:06,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:06,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:06,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 47 transitions. [2020-07-29 01:37:06,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:06,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:06,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:06,712 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 21 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:06,713 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:06,713 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:37:06,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:06,714 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:06,714 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 47 transitions. cyclomatic complexity: 18 [2020-07-29 01:37:06,715 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:06,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:06,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:06,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:06,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:06,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:06,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:06,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:37:06,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:37:06,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:37:06,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:37:06,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:37:06,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:37:06,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:06,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:06,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:06,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:06,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:06,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:06,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:06,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:06,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:06,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:06,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:06,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:06,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:06,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:06,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:06,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:06,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:06,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:06,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:06,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:06,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:06,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:37:06,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:37:06,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 47 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:37:06,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,727 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:37:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 01:37:06,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:06,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:06,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:37:06,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:06,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. cyclomatic complexity: 18 [2020-07-29 01:37:06,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:06,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2020-07-29 01:37:06,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:37:06,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:37:06,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2020-07-29 01:37:06,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:06,735 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-07-29 01:37:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2020-07-29 01:37:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2020-07-29 01:37:06,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:06,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 30 transitions. Second operand 15 states. [2020-07-29 01:37:06,737 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 30 transitions. Second operand 15 states. [2020-07-29 01:37:06,737 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 15 states. [2020-07-29 01:37:06,738 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:06,740 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-07-29 01:37:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:37:06,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:06,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:06,740 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 22 states and 30 transitions. [2020-07-29 01:37:06,741 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 22 states and 30 transitions. [2020-07-29 01:37:06,742 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:06,744 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-07-29 01:37:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:37:06,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:06,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:06,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:06,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:37:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 01:37:06,746 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:37:06,746 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:37:06,746 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:37:06,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:37:06,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:06,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:06,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:06,747 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:06,747 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:06,748 INFO L794 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 424#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; 425#L566 assume !(main_~array_size~0 < 1); 426#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 427#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 428#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 435#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 432#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 433#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 436#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 422#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 423#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 429#L554-3 [2020-07-29 01:37:06,748 INFO L796 eck$LassoCheckResult]: Loop: 429#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 434#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 431#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 429#L554-3 [2020-07-29 01:37:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2020-07-29 01:37:06,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:06,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627524052] [2020-07-29 01:37:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:06,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {549#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {549#true} is VALID [2020-07-29 01:37:06,827 INFO L280 TraceCheckUtils]: 1: Hoare triple {549#true} 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; {549#true} is VALID [2020-07-29 01:37:06,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {549#true} assume !(main_~array_size~0 < 1); {549#true} is VALID [2020-07-29 01:37:06,827 INFO L280 TraceCheckUtils]: 3: Hoare triple {549#true} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {549#true} is VALID [2020-07-29 01:37:06,828 INFO L280 TraceCheckUtils]: 4: Hoare triple {549#true} 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; {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 01:37:06,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} 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); {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 01:37:06,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 01:37:06,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {552#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 2))} is VALID [2020-07-29 01:37:06,832 INFO L280 TraceCheckUtils]: 8: Hoare triple {552#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 2))} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {553#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 2))} is VALID [2020-07-29 01:37:06,833 INFO L280 TraceCheckUtils]: 9: Hoare triple {553#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 2))} 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); {553#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 2))} is VALID [2020-07-29 01:37:06,834 INFO L280 TraceCheckUtils]: 10: Hoare triple {553#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 2))} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {554#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 01:37:06,835 INFO L280 TraceCheckUtils]: 11: Hoare triple {554#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 1))} 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; {550#false} is VALID [2020-07-29 01:37:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:06,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627524052] [2020-07-29 01:37:06,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459525824] [2020-07-29 01:37:06,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:37:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:06,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:37:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:06,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:06,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {549#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {549#true} is VALID [2020-07-29 01:37:06,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {549#true} 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; {549#true} is VALID [2020-07-29 01:37:06,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {549#true} assume !(main_~array_size~0 < 1); {549#true} is VALID [2020-07-29 01:37:06,966 INFO L280 TraceCheckUtils]: 3: Hoare triple {549#true} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {549#true} is VALID [2020-07-29 01:37:06,966 INFO L280 TraceCheckUtils]: 4: Hoare triple {549#true} 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; {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 01:37:06,967 INFO L280 TraceCheckUtils]: 5: Hoare triple {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} 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); {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 01:37:06,967 INFO L280 TraceCheckUtils]: 6: Hoare triple {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 01:37:06,968 INFO L280 TraceCheckUtils]: 7: Hoare triple {551#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {552#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 2))} is VALID [2020-07-29 01:37:06,969 INFO L280 TraceCheckUtils]: 8: Hoare triple {552#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 2))} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {553#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 2))} is VALID [2020-07-29 01:37:06,971 INFO L280 TraceCheckUtils]: 9: Hoare triple {553#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 2))} 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); {553#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 2))} is VALID [2020-07-29 01:37:06,972 INFO L280 TraceCheckUtils]: 10: Hoare triple {553#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 2))} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {554#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 01:37:06,973 INFO L280 TraceCheckUtils]: 11: Hoare triple {554#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 1))} 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; {550#false} is VALID [2020-07-29 01:37:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:06,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:37:06,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-29 01:37:06,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893396665] [2020-07-29 01:37:06,974 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:37:06,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2020-07-29 01:37:06,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:06,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223634090] [2020-07-29 01:37:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:06,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:06,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:06,987 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:07,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:07,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:37:07,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:37:07,059 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-07-29 01:37:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:07,197 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-07-29 01:37:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:37:07,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:37:07,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:07,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2020-07-29 01:37:07,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:07,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2020-07-29 01:37:07,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:37:07,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:37:07,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2020-07-29 01:37:07,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:07,218 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-07-29 01:37:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2020-07-29 01:37:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2020-07-29 01:37:07,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:07,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 35 transitions. Second operand 18 states. [2020-07-29 01:37:07,221 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 35 transitions. Second operand 18 states. [2020-07-29 01:37:07,221 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 18 states. [2020-07-29 01:37:07,222 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:07,224 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-07-29 01:37:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-07-29 01:37:07,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:07,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:07,226 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 26 states and 35 transitions. [2020-07-29 01:37:07,226 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 26 states and 35 transitions. [2020-07-29 01:37:07,227 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:07,230 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-07-29 01:37:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-07-29 01:37:07,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:07,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:07,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:07,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:37:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-07-29 01:37:07,233 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-29 01:37:07,233 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-29 01:37:07,233 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:37:07,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-07-29 01:37:07,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:07,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:07,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:07,235 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:07,235 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:07,235 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 623#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; 624#L566 assume !(main_~array_size~0 < 1); 625#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 626#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 630#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 640#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 633#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 634#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 636#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 637#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 639#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 638#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 627#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 628#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 631#L554-3 [2020-07-29 01:37:07,236 INFO L796 eck$LassoCheckResult]: Loop: 631#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 635#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 632#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 631#L554-3 [2020-07-29 01:37:07,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:07,236 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2020-07-29 01:37:07,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:07,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555241001] [2020-07-29 01:37:07,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:07,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:07,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:07,310 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:07,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:07,315 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2020-07-29 01:37:07,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:07,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236811612] [2020-07-29 01:37:07,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:07,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:07,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:07,334 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2020-07-29 01:37:07,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:07,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124587309] [2020-07-29 01:37:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:07,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:07,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:07,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:07,989 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 108 [2020-07-29 01:37:08,135 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:08,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:08,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:08,136 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:08,136 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:08,136 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:08,136 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:08,136 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:08,136 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration6_Lasso [2020-07-29 01:37:08,136 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:08,137 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:08,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,401 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-07-29 01:37:08,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:08,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:09,310 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:09,313 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:09,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:09,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:09,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:09,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:09,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:09,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:09,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:09,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:09,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:09,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:09,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:09,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:09,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:09,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:09,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:09,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:09,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:09,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:09,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:09,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:09,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:09,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:09,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:09,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:09,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:09,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:09,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:09,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:09,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:09,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:09,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:09,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:09,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:09,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:09,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:09,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:09,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:09,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:09,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:09,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:09,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:09,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:09,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:09,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:09,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:09,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:09,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:09,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:09,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:09,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:09,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:09,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:09,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:09,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:09,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:09,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:09,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:09,613 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:09,681 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-07-29 01:37:09,681 INFO L444 ModelExtractionUtils]: 6 out of 31 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:09,693 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:09,698 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:37:09,698 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:09,698 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = -8*ULTIMATE.start_SelectionSort_~j~0 + 5*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~array_size + 3 >= 0] [2020-07-29 01:37:09,761 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-07-29 01:37:09,770 INFO L393 LassoCheck]: Loop: "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);" "assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0;" "SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3;" [2020-07-29 01:37:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:09,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:37:09,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:09,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:09,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:10,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {806#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {806#unseeded} is VALID [2020-07-29 01:37:10,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {806#unseeded} 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; {806#unseeded} is VALID [2020-07-29 01:37:10,007 INFO L280 TraceCheckUtils]: 2: Hoare triple {806#unseeded} assume !(main_~array_size~0 < 1); {806#unseeded} is VALID [2020-07-29 01:37:10,009 INFO L280 TraceCheckUtils]: 3: Hoare triple {806#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {878#(and (<= ULTIMATE.start_SelectionSort_~i~0 0) unseeded)} is VALID [2020-07-29 01:37:10,010 INFO L280 TraceCheckUtils]: 4: Hoare triple {878#(and (<= ULTIMATE.start_SelectionSort_~i~0 0) unseeded)} 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; {882#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} is VALID [2020-07-29 01:37:10,010 INFO L280 TraceCheckUtils]: 5: Hoare triple {882#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} 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); {882#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} is VALID [2020-07-29 01:37:10,011 INFO L280 TraceCheckUtils]: 6: Hoare triple {882#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {882#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} is VALID [2020-07-29 01:37:10,012 INFO L280 TraceCheckUtils]: 7: Hoare triple {882#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {892#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} is VALID [2020-07-29 01:37:10,014 INFO L280 TraceCheckUtils]: 8: Hoare triple {892#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} 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); {892#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} is VALID [2020-07-29 01:37:10,014 INFO L280 TraceCheckUtils]: 9: Hoare triple {892#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {892#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} is VALID [2020-07-29 01:37:10,017 INFO L280 TraceCheckUtils]: 10: Hoare triple {892#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {902#(and (<= ULTIMATE.start_SelectionSort_~j~0 3) unseeded)} is VALID [2020-07-29 01:37:10,018 INFO L280 TraceCheckUtils]: 11: Hoare triple {902#(and (<= ULTIMATE.start_SelectionSort_~j~0 3) unseeded)} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,019 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} 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); {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,019 INFO L280 TraceCheckUtils]: 13: Hoare triple {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,021 INFO L280 TraceCheckUtils]: 14: Hoare triple {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} 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; {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:10,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {861#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) (>= oldRank0 (+ (* (- 8) ULTIMATE.start_SelectionSort_~j~0) (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))))} 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); {915#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} is VALID [2020-07-29 01:37:10,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {915#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {915#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} is VALID [2020-07-29 01:37:10,090 INFO L280 TraceCheckUtils]: 2: Hoare triple {915#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {863#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 8) ULTIMATE.start_SelectionSort_~j~0) (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base))))) unseeded) (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0))} is VALID [2020-07-29 01:37:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:10,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:37:10,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,123 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2020-07-29 01:37:10,123 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2020-07-29 01:37:10,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2020-07-29 01:37:10,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:10,188 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:10,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:10,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:10,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:10,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:37:10,189 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:10,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:10,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-07-29 01:37:10,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:10,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:10,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:10,190 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:10,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:10,191 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:37:10,192 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:10,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 6 transitions. cyclomatic complexity: 4 [2020-07-29 01:37:10,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:10,192 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:37:10,192 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:10,193 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:10,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:37:10,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:37:10,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:37:10,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:10,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:10,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:10,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:10,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:10,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:10,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,202 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:37:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:37:10,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,203 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:10,418 INFO L280 TraceCheckUtils]: 0: Hoare triple {806#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {806#unseeded} is VALID [2020-07-29 01:37:10,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {806#unseeded} 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; {806#unseeded} is VALID [2020-07-29 01:37:10,420 INFO L280 TraceCheckUtils]: 2: Hoare triple {806#unseeded} assume !(main_~array_size~0 < 1); {806#unseeded} is VALID [2020-07-29 01:37:10,420 INFO L280 TraceCheckUtils]: 3: Hoare triple {806#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {962#(and (<= ULTIMATE.start_SelectionSort_~i~0 0) unseeded)} is VALID [2020-07-29 01:37:10,421 INFO L280 TraceCheckUtils]: 4: Hoare triple {962#(and (<= ULTIMATE.start_SelectionSort_~i~0 0) unseeded)} 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; {966#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} is VALID [2020-07-29 01:37:10,422 INFO L280 TraceCheckUtils]: 5: Hoare triple {966#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} 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); {966#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} is VALID [2020-07-29 01:37:10,423 INFO L280 TraceCheckUtils]: 6: Hoare triple {966#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {966#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} is VALID [2020-07-29 01:37:10,423 INFO L280 TraceCheckUtils]: 7: Hoare triple {966#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {976#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} is VALID [2020-07-29 01:37:10,424 INFO L280 TraceCheckUtils]: 8: Hoare triple {976#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} 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); {976#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} is VALID [2020-07-29 01:37:10,428 INFO L280 TraceCheckUtils]: 9: Hoare triple {976#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {976#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} is VALID [2020-07-29 01:37:10,431 INFO L280 TraceCheckUtils]: 10: Hoare triple {976#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {986#(and (<= ULTIMATE.start_SelectionSort_~j~0 3) unseeded)} is VALID [2020-07-29 01:37:10,432 INFO L280 TraceCheckUtils]: 11: Hoare triple {986#(and (<= ULTIMATE.start_SelectionSort_~j~0 3) unseeded)} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,432 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} 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); {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,433 INFO L280 TraceCheckUtils]: 13: Hoare triple {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,434 INFO L280 TraceCheckUtils]: 14: Hoare triple {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} 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; {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:10,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {861#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) (>= oldRank0 (+ (* (- 8) ULTIMATE.start_SelectionSort_~j~0) (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))))} 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); {999#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} is VALID [2020-07-29 01:37:10,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {999#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {999#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} is VALID [2020-07-29 01:37:10,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {999#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {863#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 8) ULTIMATE.start_SelectionSort_~j~0) (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base))))) unseeded) (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0))} is VALID [2020-07-29 01:37:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:10,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:37:10,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:10,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,551 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2020-07-29 01:37:10,551 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2020-07-29 01:37:10,606 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2020-07-29 01:37:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:10,606 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:10,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:10,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:10,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:10,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:37:10,607 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:10,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:10,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-07-29 01:37:10,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:10,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:10,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:10,609 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:10,609 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:10,610 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:37:10,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:10,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 6 transitions. cyclomatic complexity: 4 [2020-07-29 01:37:10,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:10,610 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:37:10,611 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:10,612 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:10,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:37:10,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:37:10,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:37:10,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:10,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:10,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:10,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:10,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:10,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:10,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:10,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:10,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,626 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:37:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:37:10,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,627 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:10,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:10,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {806#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {806#unseeded} is VALID [2020-07-29 01:37:10,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {806#unseeded} 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; {806#unseeded} is VALID [2020-07-29 01:37:10,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {806#unseeded} assume !(main_~array_size~0 < 1); {806#unseeded} is VALID [2020-07-29 01:37:10,883 INFO L280 TraceCheckUtils]: 3: Hoare triple {806#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {1046#(and (<= ULTIMATE.start_SelectionSort_~i~0 0) unseeded)} is VALID [2020-07-29 01:37:10,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {1046#(and (<= ULTIMATE.start_SelectionSort_~i~0 0) unseeded)} 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; {1050#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} is VALID [2020-07-29 01:37:10,885 INFO L280 TraceCheckUtils]: 5: Hoare triple {1050#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} 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); {1050#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} is VALID [2020-07-29 01:37:10,886 INFO L280 TraceCheckUtils]: 6: Hoare triple {1050#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1050#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} is VALID [2020-07-29 01:37:10,888 INFO L280 TraceCheckUtils]: 7: Hoare triple {1050#(and (<= ULTIMATE.start_SelectionSort_~j~0 1) unseeded)} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1060#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} is VALID [2020-07-29 01:37:10,889 INFO L280 TraceCheckUtils]: 8: Hoare triple {1060#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} 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); {1060#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} is VALID [2020-07-29 01:37:10,892 INFO L280 TraceCheckUtils]: 9: Hoare triple {1060#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1060#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} is VALID [2020-07-29 01:37:10,893 INFO L280 TraceCheckUtils]: 10: Hoare triple {1060#(and (<= ULTIMATE.start_SelectionSort_~j~0 2) unseeded)} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1070#(and (<= ULTIMATE.start_SelectionSort_~j~0 3) unseeded)} is VALID [2020-07-29 01:37:10,894 INFO L280 TraceCheckUtils]: 11: Hoare triple {1070#(and (<= ULTIMATE.start_SelectionSort_~j~0 3) unseeded)} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,894 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} 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); {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,895 INFO L280 TraceCheckUtils]: 13: Hoare triple {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,895 INFO L280 TraceCheckUtils]: 14: Hoare triple {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} 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; {860#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) unseeded)} is VALID [2020-07-29 01:37:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:10,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:10,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {861#(and (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0) (>= oldRank0 (+ (* (- 8) ULTIMATE.start_SelectionSort_~j~0) (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))))} 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); {1083#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} is VALID [2020-07-29 01:37:10,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {1083#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {1083#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} is VALID [2020-07-29 01:37:10,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {1083#(and (<= (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (+ (* 8 ULTIMATE.start_SelectionSort_~j~0) oldRank0)) (< ULTIMATE.start_SelectionSort_~j~0 ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size 3) (<= 4 (select |#length| ULTIMATE.start_SelectionSort_~a.base)))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {863#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 8) ULTIMATE.start_SelectionSort_~j~0) (* 5 (select |#length| ULTIMATE.start_SelectionSort_~a.base))))) unseeded) (>= (+ (* (- 1) ULTIMATE.start_SelectionSort_~array_size) 3) 0))} is VALID [2020-07-29 01:37:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:10,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:37:10,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:10,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:10,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:10,991 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2020-07-29 01:37:10,992 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2020-07-29 01:37:11,492 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 60 states and 84 transitions. Complement of second has 15 states. [2020-07-29 01:37:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 01:37:11,492 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:11,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:11,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:11,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:11,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:37:11,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:11,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:11,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:11,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 84 transitions. [2020-07-29 01:37:11,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:11,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:11,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:11,497 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 01:37:11,498 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:11,498 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:37:11,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:11,500 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:11,500 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 84 transitions. cyclomatic complexity: 29 [2020-07-29 01:37:11,501 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:11,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:11,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:11,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:11,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:11,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:11,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:11,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 60 letters. Loop has 60 letters. [2020-07-29 01:37:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 01:37:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 60 letters. Loop has 60 letters. [2020-07-29 01:37:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:37:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:37:11,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:37:11,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:37:11,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:11,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:11,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:11,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:11,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:11,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:11,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:11,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:11,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:11,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:11,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:11,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:11,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:11,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:11,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:11,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:11,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:11,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 84 transitions. cyclomatic complexity: 29 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:11,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,516 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:37:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2020-07-29 01:37:11,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:11,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:11,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:37:11,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:11,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 84 transitions. cyclomatic complexity: 29 [2020-07-29 01:37:11,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:11,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 46 transitions. [2020-07-29 01:37:11,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:37:11,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:37:11,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 46 transitions. [2020-07-29 01:37:11,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:11,522 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2020-07-29 01:37:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 46 transitions. [2020-07-29 01:37:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2020-07-29 01:37:11,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:11,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 46 transitions. Second operand 21 states. [2020-07-29 01:37:11,525 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 46 transitions. Second operand 21 states. [2020-07-29 01:37:11,525 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand 21 states. [2020-07-29 01:37:11,526 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:11,527 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-07-29 01:37:11,528 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2020-07-29 01:37:11,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:11,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:11,528 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 34 states and 46 transitions. [2020-07-29 01:37:11,528 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 34 states and 46 transitions. [2020-07-29 01:37:11,529 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:11,531 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-07-29 01:37:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2020-07-29 01:37:11,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:11,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:11,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:11,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:37:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2020-07-29 01:37:11,533 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 01:37:11,533 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 01:37:11,533 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:37:11,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:37:11,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:11,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:11,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:11,534 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:11,534 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:11,535 INFO L794 eck$LassoCheckResult]: Stem: 1192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1186#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; 1187#L566 assume !(main_~array_size~0 < 1); 1188#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 1189#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1193#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1206#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1197#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1194#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1199#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1200#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1205#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1203#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1204#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1202#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1201#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1190#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1191#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1195#L554-3 [2020-07-29 01:37:11,535 INFO L796 eck$LassoCheckResult]: Loop: 1195#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1198#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1196#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1195#L554-3 [2020-07-29 01:37:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash 661745927, now seen corresponding path program 3 times [2020-07-29 01:37:11,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:11,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419045284] [2020-07-29 01:37:11,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:11,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:11,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:11,572 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2020-07-29 01:37:11,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:11,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907452096] [2020-07-29 01:37:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:11,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:11,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:11,581 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash 173047542, now seen corresponding path program 2 times [2020-07-29 01:37:11,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:11,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826739326] [2020-07-29 01:37:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:11,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:11,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:11,632 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:12,211 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2020-07-29 01:37:12,386 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:12,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:12,387 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:12,387 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:12,387 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:12,387 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:12,387 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:12,387 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:12,387 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration7_Lasso [2020-07-29 01:37:12,388 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:12,388 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:12,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:12,741 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2020-07-29 01:37:13,535 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:13,535 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:13,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:13,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:13,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:13,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:13,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:13,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:13,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:13,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:13,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:13,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:13,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:13,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:13,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:13,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:13,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:13,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:13,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:13,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:13,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:13,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:13,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:13,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:13,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:13,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:13,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:13,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:13,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:13,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:13,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:13,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:13,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:13,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:13,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:13,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:13,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:13,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:13,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:13,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:13,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:13,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:13,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:13,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:13,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:13,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:13,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:13,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:13,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:13,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:14,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:14,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:14,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:14,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:14,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:14,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:14,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:14,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:14,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:14,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:14,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:14,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:14,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:14,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:14,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:14,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:14,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:14,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:14,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:14,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:14,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:14,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:14,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:14,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:14,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:14,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:14,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:14,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:14,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:14,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:14,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:14,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:14,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:14,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:14,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:14,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:14,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:14,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:14,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:14,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:14,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:14,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:14,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:14,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:14,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:14,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:14,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:14,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:14,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:14,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:14,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:14,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:14,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:14,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:14,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:14,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:14,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:14,292 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:14,326 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:37:14,326 INFO L444 ModelExtractionUtils]: 14 out of 34 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:14,329 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:14,333 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:37:14,333 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:14,333 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_~min~0) = 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_4 - 1*ULTIMATE.start_SelectionSort_~a.offset - 4*ULTIMATE.start_SelectionSort_~min~0 Supporting invariants [1*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~min~0 - 1 >= 0] [2020-07-29 01:37:14,409 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-07-29 01:37:14,415 INFO L393 LassoCheck]: Loop: "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);" "assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0;" "SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3;" [2020-07-29 01:37:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:14,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:37:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:14,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:14,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:14,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {1386#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1386#unseeded} is VALID [2020-07-29 01:37:14,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {1386#unseeded} 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; {1386#unseeded} is VALID [2020-07-29 01:37:14,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {1386#unseeded} assume !(main_~array_size~0 < 1); {1386#unseeded} is VALID [2020-07-29 01:37:14,492 INFO L280 TraceCheckUtils]: 3: Hoare triple {1386#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {1386#unseeded} is VALID [2020-07-29 01:37:14,492 INFO L280 TraceCheckUtils]: 4: Hoare triple {1386#unseeded} 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; {1386#unseeded} is VALID [2020-07-29 01:37:14,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:14,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:14,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:14,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:14,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:14,495 INFO L280 TraceCheckUtils]: 10: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:14,495 INFO L280 TraceCheckUtils]: 11: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:14,496 INFO L280 TraceCheckUtils]: 12: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:14,496 INFO L280 TraceCheckUtils]: 13: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:14,497 INFO L280 TraceCheckUtils]: 14: Hoare triple {1386#unseeded} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {1386#unseeded} is VALID [2020-07-29 01:37:14,500 INFO L280 TraceCheckUtils]: 15: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:14,508 INFO L280 TraceCheckUtils]: 16: Hoare triple {1386#unseeded} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {1386#unseeded} is VALID [2020-07-29 01:37:14,510 INFO L280 TraceCheckUtils]: 17: Hoare triple {1386#unseeded} 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; {1455#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) unseeded)} is VALID [2020-07-29 01:37:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:14,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:14,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:14,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {1456#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (>= oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset) (* (- 4) ULTIMATE.start_SelectionSort_~min~0))))} 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); {1515#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 01:37:14,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {1515#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {1519#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0) (= ULTIMATE.start_SelectionSort_~min~0 ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 01:37:14,614 INFO L280 TraceCheckUtils]: 2: Hoare triple {1519#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0) (= ULTIMATE.start_SelectionSort_~min~0 ULTIMATE.start_SelectionSort_~j~0))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1458#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset) (* (- 4) ULTIMATE.start_SelectionSort_~min~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:37:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:14,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:14,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:14,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,631 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 [2020-07-29 01:37:14,631 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:37:14,795 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 8 states. [2020-07-29 01:37:14,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 01:37:14,795 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:14,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:14,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:14,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:14,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:37:14,797 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:14,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:14,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2020-07-29 01:37:14,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:14,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:14,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:14,799 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:14,799 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:14,800 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:37:14,800 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:14,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 14 transitions. cyclomatic complexity: 11 [2020-07-29 01:37:14,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:14,801 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:37:14,801 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 16 [2020-07-29 01:37:14,802 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:14,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:37:14,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:37:14,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:37:14,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:14,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:14,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:14,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:14,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:14,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:14,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:14,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:14,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:14,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:14,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:14,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:14,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:14,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:14,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:14,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:14,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:14,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:14,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,811 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:37:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-29 01:37:14,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:14,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:14,813 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:14,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:14,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:14,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:14,875 INFO L280 TraceCheckUtils]: 0: Hoare triple {1386#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1386#unseeded} is VALID [2020-07-29 01:37:14,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {1386#unseeded} 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; {1386#unseeded} is VALID [2020-07-29 01:37:14,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {1386#unseeded} assume !(main_~array_size~0 < 1); {1386#unseeded} is VALID [2020-07-29 01:37:14,882 INFO L280 TraceCheckUtils]: 3: Hoare triple {1386#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {1386#unseeded} is VALID [2020-07-29 01:37:14,882 INFO L280 TraceCheckUtils]: 4: Hoare triple {1386#unseeded} 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; {1386#unseeded} is VALID [2020-07-29 01:37:14,883 INFO L280 TraceCheckUtils]: 5: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:14,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:14,884 INFO L280 TraceCheckUtils]: 7: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:14,885 INFO L280 TraceCheckUtils]: 8: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:14,886 INFO L280 TraceCheckUtils]: 9: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:14,886 INFO L280 TraceCheckUtils]: 10: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:14,887 INFO L280 TraceCheckUtils]: 11: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:14,888 INFO L280 TraceCheckUtils]: 12: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:14,889 INFO L280 TraceCheckUtils]: 13: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:14,889 INFO L280 TraceCheckUtils]: 14: Hoare triple {1386#unseeded} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {1386#unseeded} is VALID [2020-07-29 01:37:14,890 INFO L280 TraceCheckUtils]: 15: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:14,891 INFO L280 TraceCheckUtils]: 16: Hoare triple {1386#unseeded} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {1386#unseeded} is VALID [2020-07-29 01:37:14,892 INFO L280 TraceCheckUtils]: 17: Hoare triple {1386#unseeded} 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; {1455#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) unseeded)} is VALID [2020-07-29 01:37:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:14,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:14,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:15,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {1456#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (>= oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset) (* (- 4) ULTIMATE.start_SelectionSort_~min~0))))} 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); {1642#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 01:37:15,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {1642#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {1646#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0) (= ULTIMATE.start_SelectionSort_~min~0 ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 01:37:15,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {1646#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0) (= ULTIMATE.start_SelectionSort_~min~0 ULTIMATE.start_SelectionSort_~j~0))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1458#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset) (* (- 4) ULTIMATE.start_SelectionSort_~min~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:37:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:15,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:15,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:15,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,034 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 [2020-07-29 01:37:15,035 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:37:15,194 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2020-07-29 01:37:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:15,195 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:15,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:15,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:15,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:15,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:37:15,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:37:15,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:15,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:15,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 69 transitions. [2020-07-29 01:37:15,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:15,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:15,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:15,198 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:15,198 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:15,198 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:37:15,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:37:15,199 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:15,199 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 52 states and 69 transitions. cyclomatic complexity: 21 [2020-07-29 01:37:15,200 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:15,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:15,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:15,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:15,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 52 letters. [2020-07-29 01:37:15,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 52 letters. Loop has 52 letters. [2020-07-29 01:37:15,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 52 letters. Loop has 52 letters. [2020-07-29 01:37:15,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:15,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:15,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:15,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:15,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:15,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:15,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:15,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:15,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:15,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:15,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:15,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:15,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:15,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:15,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:15,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 69 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,214 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:37:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-07-29 01:37:15,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,216 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:15,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:15,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:15,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {1386#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1386#unseeded} is VALID [2020-07-29 01:37:15,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {1386#unseeded} 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; {1386#unseeded} is VALID [2020-07-29 01:37:15,296 INFO L280 TraceCheckUtils]: 2: Hoare triple {1386#unseeded} assume !(main_~array_size~0 < 1); {1386#unseeded} is VALID [2020-07-29 01:37:15,297 INFO L280 TraceCheckUtils]: 3: Hoare triple {1386#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {1386#unseeded} is VALID [2020-07-29 01:37:15,299 INFO L280 TraceCheckUtils]: 4: Hoare triple {1386#unseeded} 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; {1386#unseeded} is VALID [2020-07-29 01:37:15,300 INFO L280 TraceCheckUtils]: 5: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:15,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:15,301 INFO L280 TraceCheckUtils]: 7: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:15,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:15,302 INFO L280 TraceCheckUtils]: 9: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:15,303 INFO L280 TraceCheckUtils]: 10: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:15,304 INFO L280 TraceCheckUtils]: 11: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:15,310 INFO L280 TraceCheckUtils]: 12: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:15,311 INFO L280 TraceCheckUtils]: 13: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:15,311 INFO L280 TraceCheckUtils]: 14: Hoare triple {1386#unseeded} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {1386#unseeded} is VALID [2020-07-29 01:37:15,312 INFO L280 TraceCheckUtils]: 15: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:15,312 INFO L280 TraceCheckUtils]: 16: Hoare triple {1386#unseeded} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {1386#unseeded} is VALID [2020-07-29 01:37:15,313 INFO L280 TraceCheckUtils]: 17: Hoare triple {1386#unseeded} 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; {1455#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) unseeded)} is VALID [2020-07-29 01:37:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:15,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:15,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:15,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {1456#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (>= oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset) (* (- 4) ULTIMATE.start_SelectionSort_~min~0))))} 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); {1773#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 01:37:15,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {1773#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {1777#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0) (= ULTIMATE.start_SelectionSort_~min~0 ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 01:37:15,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {1777#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0) (= ULTIMATE.start_SelectionSort_~min~0 ULTIMATE.start_SelectionSort_~j~0))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1458#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset) (* (- 4) ULTIMATE.start_SelectionSort_~min~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:37:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:15,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:15,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:15,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,476 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 [2020-07-29 01:37:15,477 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:37:15,669 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 57 states and 72 transitions. Complement of second has 7 states. [2020-07-29 01:37:15,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 01:37:15,670 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:15,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:15,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:15,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:15,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:37:15,672 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:15,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:15,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 72 transitions. [2020-07-29 01:37:15,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:37:15,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:15,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:15,673 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:15,673 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:15,673 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:37:15,674 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:15,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 22 transitions. cyclomatic complexity: 19 [2020-07-29 01:37:15,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:15,675 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:37:15,675 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 57 states and 72 transitions. cyclomatic complexity: 19 [2020-07-29 01:37:15,676 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:37:15,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 57 letters. Loop has 57 letters. [2020-07-29 01:37:15,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 57 letters. Loop has 57 letters. [2020-07-29 01:37:15,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 57 letters. Loop has 57 letters. [2020-07-29 01:37:15,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:15,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:15,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:15,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:15,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:15,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:15,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:15,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:15,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:15,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:15,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:15,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:15,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:15,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:15,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:15,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:15,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:15,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:15,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:15,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:37:15,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:37:15,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:37:15,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:37:15,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:37:15,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 19 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:37:15,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,688 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:37:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-07-29 01:37:15,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,690 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:15,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:15,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:15,772 INFO L280 TraceCheckUtils]: 0: Hoare triple {1386#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1386#unseeded} is VALID [2020-07-29 01:37:15,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {1386#unseeded} 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; {1386#unseeded} is VALID [2020-07-29 01:37:15,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {1386#unseeded} assume !(main_~array_size~0 < 1); {1386#unseeded} is VALID [2020-07-29 01:37:15,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {1386#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {1386#unseeded} is VALID [2020-07-29 01:37:15,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {1386#unseeded} 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; {1386#unseeded} is VALID [2020-07-29 01:37:15,776 INFO L280 TraceCheckUtils]: 5: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:15,777 INFO L280 TraceCheckUtils]: 6: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:15,777 INFO L280 TraceCheckUtils]: 7: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:15,778 INFO L280 TraceCheckUtils]: 8: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:15,778 INFO L280 TraceCheckUtils]: 9: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:15,778 INFO L280 TraceCheckUtils]: 10: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:15,779 INFO L280 TraceCheckUtils]: 11: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:15,779 INFO L280 TraceCheckUtils]: 12: Hoare triple {1386#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {1386#unseeded} is VALID [2020-07-29 01:37:15,780 INFO L280 TraceCheckUtils]: 13: Hoare triple {1386#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1386#unseeded} is VALID [2020-07-29 01:37:15,780 INFO L280 TraceCheckUtils]: 14: Hoare triple {1386#unseeded} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {1386#unseeded} is VALID [2020-07-29 01:37:15,780 INFO L280 TraceCheckUtils]: 15: Hoare triple {1386#unseeded} 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); {1386#unseeded} is VALID [2020-07-29 01:37:15,781 INFO L280 TraceCheckUtils]: 16: Hoare triple {1386#unseeded} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {1386#unseeded} is VALID [2020-07-29 01:37:15,782 INFO L280 TraceCheckUtils]: 17: Hoare triple {1386#unseeded} 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; {1455#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) unseeded)} is VALID [2020-07-29 01:37:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:15,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:15,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:15,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {1456#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (>= oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset) (* (- 4) ULTIMATE.start_SelectionSort_~min~0))))} 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); {1910#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 01:37:15,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {1910#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {1914#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0) (= ULTIMATE.start_SelectionSort_~min~0 ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 01:37:15,904 INFO L280 TraceCheckUtils]: 2: Hoare triple {1914#(and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~a.offset 4) (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (<= (+ (div (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* ULTIMATE.start_SelectionSort_~a.offset (- 1)) (* oldRank0 (- 1)) (- 1)) 4) 2) ULTIMATE.start_SelectionSort_~j~0) (= ULTIMATE.start_SelectionSort_~min~0 ULTIMATE.start_SelectionSort_~j~0))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1458#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset) (* (- 4) ULTIMATE.start_SelectionSort_~min~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:37:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:15,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:15,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:15,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:15,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:15,921 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 [2020-07-29 01:37:15,921 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:37:16,078 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 50 states and 66 transitions. Complement of second has 8 states. [2020-07-29 01:37:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:16,078 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:16,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:16,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:16,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:16,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:37:16,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:37:16,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:16,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:16,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2020-07-29 01:37:16,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:16,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:16,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:16,081 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:16,081 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:16,081 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:37:16,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:37:16,082 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:16,082 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 66 transitions. cyclomatic complexity: 19 [2020-07-29 01:37:16,083 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:16,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:16,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:37:16,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:37:16,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:37:16,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:16,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:16,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:37:16,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:16,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:16,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:16,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:16,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:16,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:16,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:16,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:16,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:16,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 19 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,094 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:37:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-29 01:37:16,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 6 letters. [2020-07-29 01:37:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:16,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. cyclomatic complexity: 19 [2020-07-29 01:37:16,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:16,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 43 states and 57 transitions. [2020-07-29 01:37:16,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:37:16,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:37:16,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2020-07-29 01:37:16,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:16,099 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-07-29 01:37:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2020-07-29 01:37:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-07-29 01:37:16,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:16,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 57 transitions. Second operand 40 states. [2020-07-29 01:37:16,102 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 57 transitions. Second operand 40 states. [2020-07-29 01:37:16,102 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand 40 states. [2020-07-29 01:37:16,103 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:16,106 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2020-07-29 01:37:16,106 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2020-07-29 01:37:16,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:16,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:16,107 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 43 states and 57 transitions. [2020-07-29 01:37:16,107 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 43 states and 57 transitions. [2020-07-29 01:37:16,107 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:16,111 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2020-07-29 01:37:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2020-07-29 01:37:16,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:16,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:16,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:16,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:37:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2020-07-29 01:37:16,115 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2020-07-29 01:37:16,116 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2020-07-29 01:37:16,116 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:37:16,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2020-07-29 01:37:16,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:16,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:16,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:16,117 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:16,117 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:16,117 INFO L794 eck$LassoCheckResult]: Stem: 1991#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1986#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; 1987#L566 assume !(main_~array_size~0 < 1); 1982#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 1983#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1988#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1997#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2021#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1989#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2018#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2016#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2012#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2002#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2008#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2001#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2000#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1984#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1985#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1990#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1996#L556 [2020-07-29 01:37:16,117 INFO L796 eck$LassoCheckResult]: Loop: 1996#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1992#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1993#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1996#L556 [2020-07-29 01:37:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash 19120306, now seen corresponding path program 3 times [2020-07-29 01:37:16,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:16,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669101398] [2020-07-29 01:37:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:16,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:16,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:16,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 1 times [2020-07-29 01:37:16,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:16,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276850946] [2020-07-29 01:37:16,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:16,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:16,186 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:16,188 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:16,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1617584475, now seen corresponding path program 4 times [2020-07-29 01:37:16,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:16,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56830122] [2020-07-29 01:37:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:16,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:16,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:16,254 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:17,167 WARN L193 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 139 [2020-07-29 01:37:17,379 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-07-29 01:37:17,382 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:17,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:17,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:17,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:17,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:17,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:17,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:17,383 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:17,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration8_Lasso [2020-07-29 01:37:17,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:17,383 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:17,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,762 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2020-07-29 01:37:17,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:17,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,314 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-29 01:37:18,750 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:18,751 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:18,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:18,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:18,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:18,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:18,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:18,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:18,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:18,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:18,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:18,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:18,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:18,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:18,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:18,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:18,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:18,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:18,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:18,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:18,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:18,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:18,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:18,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:18,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:18,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:18,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:18,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:18,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:18,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:18,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:18,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:18,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:18,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:18,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:18,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:18,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:18,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:18,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:18,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:18,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:18,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:18,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:18,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:18,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:18,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:18,979 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:19,034 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2020-07-29 01:37:19,034 INFO L444 ModelExtractionUtils]: 16 out of 40 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:19,040 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:19,044 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:37:19,044 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:19,045 INFO L512 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 [] [2020-07-29 01:37:19,150 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2020-07-29 01:37:19,154 INFO L393 LassoCheck]: Loop: "assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;" "SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3;" "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);" [2020-07-29 01:37:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:19,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {2257#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2257#unseeded} is VALID [2020-07-29 01:37:19,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {2257#unseeded} 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; {2257#unseeded} is VALID [2020-07-29 01:37:19,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {2257#unseeded} assume !(main_~array_size~0 < 1); {2257#unseeded} is VALID [2020-07-29 01:37:19,215 INFO L280 TraceCheckUtils]: 3: Hoare triple {2257#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {2257#unseeded} is VALID [2020-07-29 01:37:19,216 INFO L280 TraceCheckUtils]: 4: Hoare triple {2257#unseeded} 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; {2257#unseeded} is VALID [2020-07-29 01:37:19,216 INFO L280 TraceCheckUtils]: 5: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,217 INFO L280 TraceCheckUtils]: 6: Hoare triple {2257#unseeded} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {2257#unseeded} is VALID [2020-07-29 01:37:19,217 INFO L280 TraceCheckUtils]: 7: Hoare triple {2257#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2257#unseeded} is VALID [2020-07-29 01:37:19,218 INFO L280 TraceCheckUtils]: 8: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,218 INFO L280 TraceCheckUtils]: 9: Hoare triple {2257#unseeded} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {2257#unseeded} is VALID [2020-07-29 01:37:19,219 INFO L280 TraceCheckUtils]: 10: Hoare triple {2257#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2257#unseeded} is VALID [2020-07-29 01:37:19,219 INFO L280 TraceCheckUtils]: 11: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,220 INFO L280 TraceCheckUtils]: 12: Hoare triple {2257#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {2257#unseeded} is VALID [2020-07-29 01:37:19,220 INFO L280 TraceCheckUtils]: 13: Hoare triple {2257#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2257#unseeded} is VALID [2020-07-29 01:37:19,221 INFO L280 TraceCheckUtils]: 14: Hoare triple {2257#unseeded} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {2257#unseeded} is VALID [2020-07-29 01:37:19,222 INFO L280 TraceCheckUtils]: 15: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,228 INFO L280 TraceCheckUtils]: 16: Hoare triple {2257#unseeded} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {2257#unseeded} is VALID [2020-07-29 01:37:19,229 INFO L280 TraceCheckUtils]: 17: Hoare triple {2257#unseeded} 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; {2257#unseeded} is VALID [2020-07-29 01:37:19,229 INFO L280 TraceCheckUtils]: 18: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:19,282 INFO L280 TraceCheckUtils]: 0: Hoare triple {2260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {2260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} is VALID [2020-07-29 01:37:19,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {2260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2422#(<= (+ ULTIMATE.start_SelectionSort_~array_size 1) (+ ULTIMATE.start_SelectionSort_~j~0 oldRank0))} is VALID [2020-07-29 01:37:19,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {2422#(<= (+ ULTIMATE.start_SelectionSort_~array_size 1) (+ ULTIMATE.start_SelectionSort_~j~0 oldRank0))} 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); {2360#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:37:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:19,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:19,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:19,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,295 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:37:19,295 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-29 01:37:19,369 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 77 states and 101 transitions. Complement of second has 7 states. [2020-07-29 01:37:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:19,370 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:19,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. cyclomatic complexity: 17 [2020-07-29 01:37:19,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:37:19,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 101 transitions. [2020-07-29 01:37:19,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,372 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 54 transitions. cyclomatic complexity: 17 [2020-07-29 01:37:19,373 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:19,373 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:37:19,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,374 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:19,374 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 77 states and 101 transitions. cyclomatic complexity: 29 [2020-07-29 01:37:19,374 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:19,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:37:19,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:37:19,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:37:19,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:19,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:19,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:19,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:19,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:19,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:19,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,385 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:37:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:37:19,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,386 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:19,454 INFO L280 TraceCheckUtils]: 0: Hoare triple {2257#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2257#unseeded} is VALID [2020-07-29 01:37:19,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {2257#unseeded} 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; {2257#unseeded} is VALID [2020-07-29 01:37:19,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {2257#unseeded} assume !(main_~array_size~0 < 1); {2257#unseeded} is VALID [2020-07-29 01:37:19,456 INFO L280 TraceCheckUtils]: 3: Hoare triple {2257#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {2257#unseeded} is VALID [2020-07-29 01:37:19,457 INFO L280 TraceCheckUtils]: 4: Hoare triple {2257#unseeded} 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; {2257#unseeded} is VALID [2020-07-29 01:37:19,457 INFO L280 TraceCheckUtils]: 5: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,458 INFO L280 TraceCheckUtils]: 6: Hoare triple {2257#unseeded} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {2257#unseeded} is VALID [2020-07-29 01:37:19,458 INFO L280 TraceCheckUtils]: 7: Hoare triple {2257#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2257#unseeded} is VALID [2020-07-29 01:37:19,459 INFO L280 TraceCheckUtils]: 8: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {2257#unseeded} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {2257#unseeded} is VALID [2020-07-29 01:37:19,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {2257#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2257#unseeded} is VALID [2020-07-29 01:37:19,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,462 INFO L280 TraceCheckUtils]: 12: Hoare triple {2257#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {2257#unseeded} is VALID [2020-07-29 01:37:19,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {2257#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2257#unseeded} is VALID [2020-07-29 01:37:19,463 INFO L280 TraceCheckUtils]: 14: Hoare triple {2257#unseeded} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {2257#unseeded} is VALID [2020-07-29 01:37:19,463 INFO L280 TraceCheckUtils]: 15: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,464 INFO L280 TraceCheckUtils]: 16: Hoare triple {2257#unseeded} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {2257#unseeded} is VALID [2020-07-29 01:37:19,465 INFO L280 TraceCheckUtils]: 17: Hoare triple {2257#unseeded} 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; {2257#unseeded} is VALID [2020-07-29 01:37:19,465 INFO L280 TraceCheckUtils]: 18: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:19,520 INFO L280 TraceCheckUtils]: 0: Hoare triple {2260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {2260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} is VALID [2020-07-29 01:37:19,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {2260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2574#(<= (+ ULTIMATE.start_SelectionSort_~array_size 1) (+ ULTIMATE.start_SelectionSort_~j~0 oldRank0))} is VALID [2020-07-29 01:37:19,523 INFO L280 TraceCheckUtils]: 2: Hoare triple {2574#(<= (+ ULTIMATE.start_SelectionSort_~array_size 1) (+ ULTIMATE.start_SelectionSort_~j~0 oldRank0))} 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); {2360#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:37:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:19,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:19,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:19,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,533 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:37:19,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-29 01:37:19,586 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 77 states and 101 transitions. Complement of second has 7 states. [2020-07-29 01:37:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:19,587 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:19,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. cyclomatic complexity: 17 [2020-07-29 01:37:19,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:37:19,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 101 transitions. [2020-07-29 01:37:19,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,590 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 54 transitions. cyclomatic complexity: 17 [2020-07-29 01:37:19,590 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:19,590 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:37:19,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,591 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:19,592 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 77 states and 101 transitions. cyclomatic complexity: 29 [2020-07-29 01:37:19,592 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:19,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:37:19,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:37:19,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:37:19,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:19,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:19,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:19,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:19,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:19,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:19,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 101 transitions. cyclomatic complexity: 29 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,608 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:37:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:37:19,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,609 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:19,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {2257#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2257#unseeded} is VALID [2020-07-29 01:37:19,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {2257#unseeded} 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; {2257#unseeded} is VALID [2020-07-29 01:37:19,686 INFO L280 TraceCheckUtils]: 2: Hoare triple {2257#unseeded} assume !(main_~array_size~0 < 1); {2257#unseeded} is VALID [2020-07-29 01:37:19,686 INFO L280 TraceCheckUtils]: 3: Hoare triple {2257#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; {2257#unseeded} is VALID [2020-07-29 01:37:19,687 INFO L280 TraceCheckUtils]: 4: Hoare triple {2257#unseeded} 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; {2257#unseeded} is VALID [2020-07-29 01:37:19,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {2257#unseeded} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {2257#unseeded} is VALID [2020-07-29 01:37:19,688 INFO L280 TraceCheckUtils]: 7: Hoare triple {2257#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2257#unseeded} is VALID [2020-07-29 01:37:19,688 INFO L280 TraceCheckUtils]: 8: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,689 INFO L280 TraceCheckUtils]: 9: Hoare triple {2257#unseeded} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; {2257#unseeded} is VALID [2020-07-29 01:37:19,689 INFO L280 TraceCheckUtils]: 10: Hoare triple {2257#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2257#unseeded} is VALID [2020-07-29 01:37:19,689 INFO L280 TraceCheckUtils]: 11: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,690 INFO L280 TraceCheckUtils]: 12: Hoare triple {2257#unseeded} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {2257#unseeded} is VALID [2020-07-29 01:37:19,690 INFO L280 TraceCheckUtils]: 13: Hoare triple {2257#unseeded} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2257#unseeded} is VALID [2020-07-29 01:37:19,691 INFO L280 TraceCheckUtils]: 14: Hoare triple {2257#unseeded} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {2257#unseeded} is VALID [2020-07-29 01:37:19,691 INFO L280 TraceCheckUtils]: 15: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,693 INFO L280 TraceCheckUtils]: 16: Hoare triple {2257#unseeded} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {2257#unseeded} is VALID [2020-07-29 01:37:19,693 INFO L280 TraceCheckUtils]: 17: Hoare triple {2257#unseeded} 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; {2257#unseeded} is VALID [2020-07-29 01:37:19,694 INFO L280 TraceCheckUtils]: 18: Hoare triple {2257#unseeded} 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); {2257#unseeded} is VALID [2020-07-29 01:37:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:19,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {2260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; {2260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} is VALID [2020-07-29 01:37:19,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {2260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {2726#(<= (+ ULTIMATE.start_SelectionSort_~array_size 1) (+ ULTIMATE.start_SelectionSort_~j~0 oldRank0))} is VALID [2020-07-29 01:37:19,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {2726#(<= (+ ULTIMATE.start_SelectionSort_~array_size 1) (+ ULTIMATE.start_SelectionSort_~j~0 oldRank0))} 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); {2360#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:37:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:19,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:19,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:19,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,760 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:37:19,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-29 01:37:19,831 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 67 states and 85 transitions. Complement of second has 6 states. [2020-07-29 01:37:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:19,832 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:19,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. cyclomatic complexity: 17 [2020-07-29 01:37:19,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:37:19,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 85 transitions. [2020-07-29 01:37:19,834 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:19,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:19,835 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 54 transitions. cyclomatic complexity: 17 [2020-07-29 01:37:19,835 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:19,835 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:37:19,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,836 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:19,836 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 67 states and 85 transitions. cyclomatic complexity: 21 [2020-07-29 01:37:19,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 85 transitions. cyclomatic complexity: 21 [2020-07-29 01:37:19,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:19,836 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:37:19,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 85 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 85 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 67 letters. Loop has 67 letters. [2020-07-29 01:37:19,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 67 letters. Loop has 67 letters. [2020-07-29 01:37:19,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 85 transitions. cyclomatic complexity: 21 Stem has 67 letters. Loop has 67 letters. [2020-07-29 01:37:19,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:19,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:19,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 85 transitions. cyclomatic complexity: 21 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:19,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:19,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:19,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 85 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:19,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 85 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:37:19,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 85 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:37:19,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 85 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 85 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:19,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,844 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:37:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-29 01:37:19,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:37:19,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:37:19,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 6 letters. [2020-07-29 01:37:19,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 85 transitions. cyclomatic complexity: 21 [2020-07-29 01:37:19,847 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:19,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2020-07-29 01:37:19,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:37:19,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:37:19,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:37:19,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:19,848 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:37:19,848 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:37:19,848 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:37:19,848 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:37:19,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:37:19,849 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:19,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:19,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:37:19 BoogieIcfgContainer [2020-07-29 01:37:19,856 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:37:19,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:37:19,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:37:19,856 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:37:19,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:00" (3/4) ... [2020-07-29 01:37:19,861 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:37:19,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:37:19,865 INFO L168 Benchmark]: Toolchain (without parser) took 20186.35 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 474.5 MB). Free memory was 953.5 MB in the beginning and 1.3 GB in the end (delta: -336.9 MB). Peak memory consumption was 137.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:19,865 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:19,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:19,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:19,867 INFO L168 Benchmark]: Boogie Preprocessor took 33.73 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. [2020-07-29 01:37:19,867 INFO L168 Benchmark]: RCFGBuilder took 473.45 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:19,868 INFO L168 Benchmark]: BuchiAutomizer took 18883.23 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -196.7 MB). Peak memory consumption was 130.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:19,868 INFO L168 Benchmark]: Witness Printer took 5.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:19,873 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 727.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.73 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 473.45 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18883.23 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -196.7 MB). Peak memory consumption was 130.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 (3 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -1 * i + \old(array_size) and consists of 4 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[a] + -1 * a and consists of 4 locations. One nondeterministic module has affine ranking function -8 * j + 5 * unknown-#length-unknown[a] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a + -4 * min and consists of 5 locations. One nondeterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.8s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 13.4s. Construction of modules took 0.5s. Büchi inclusion checks took 4.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 32 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, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 155 SDtfs, 265 SDslu, 102 SDs, 0 SdLazy, 245 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital216 mio100 ax108 hnf98 lsp87 ukn73 mio100 lsp68 div100 bol100 ite100 ukn100 eq168 hnf85 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...