./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/selectionsort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 82679d367c32c359f0c9c81b27b57deea5682b2b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:26:30,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:26:30,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:26:30,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:26:30,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:26:30,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:26:30,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:26:30,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:26:30,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:26:30,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:26:30,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:26:30,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:26:30,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:26:30,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:26:30,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:26:30,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:26:30,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:26:30,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:26:30,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:26:30,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:26:30,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:26:30,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:26:30,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:26:30,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:26:30,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:26:30,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:26:30,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:26:30,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:26:30,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:26:30,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:26:30,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:26:30,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:26:30,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:26:30,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:26:30,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:26:30,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:26:30,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:26:30,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:26:30,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:26:30,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:26:30,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:26:30,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:26:30,240 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:26:30,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:26:30,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:26:30,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:26:30,243 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:26:30,244 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:26:30,244 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:26:30,244 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:26:30,244 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:26:30,244 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:26:30,245 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:26:30,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:26:30,246 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:26:30,247 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:26:30,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:26:30,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:26:30,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:26:30,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:26:30,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:26:30,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:26:30,248 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:26:30,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:26:30,248 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:26:30,249 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:26:30,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:26:30,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:26:30,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:26:30,250 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:26:30,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:26:30,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:26:30,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:26:30,251 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:26:30,253 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:26:30,253 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82679d367c32c359f0c9c81b27b57deea5682b2b [2020-07-29 03:26:30,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:26:30,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:26:30,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:26:30,607 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:26:30,609 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:26:30,610 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2020-07-29 03:26:30,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e56aceb/a070b9d3f65841b1b39caa3554c53162/FLAG761a03608 [2020-07-29 03:26:31,295 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:26:31,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2020-07-29 03:26:31,312 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e56aceb/a070b9d3f65841b1b39caa3554c53162/FLAG761a03608 [2020-07-29 03:26:31,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e56aceb/a070b9d3f65841b1b39caa3554c53162 [2020-07-29 03:26:31,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:26:31,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:26:31,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:31,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:26:31,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:26:31,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:31" (1/1) ... [2020-07-29 03:26:31,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40176bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:31, skipping insertion in model container [2020-07-29 03:26:31,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:31" (1/1) ... [2020-07-29 03:26:31,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:26:31,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:26:32,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:32,099 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:26:32,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:32,264 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:26:32,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32 WrapperNode [2020-07-29 03:26:32,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:32,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:32,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:26:32,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:26:32,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (1/1) ... [2020-07-29 03:26:32,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (1/1) ... [2020-07-29 03:26:32,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:32,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:26:32,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:26:32,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:26:32,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (1/1) ... [2020-07-29 03:26:32,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (1/1) ... [2020-07-29 03:26:32,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (1/1) ... [2020-07-29 03:26:32,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (1/1) ... [2020-07-29 03:26:32,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (1/1) ... [2020-07-29 03:26:32,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (1/1) ... [2020-07-29 03:26:32,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (1/1) ... [2020-07-29 03:26:32,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:26:32,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:26:32,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:26:32,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:26:32,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (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 03:26:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:26:32,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:26:32,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:26:32,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:26:32,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:26:32,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:26:32,886 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:26:32,887 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 03:26:32,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:32 BoogieIcfgContainer [2020-07-29 03:26:32,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:26:32,891 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:26:32,891 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:26:32,895 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:26:32,896 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:32,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:26:31" (1/3) ... [2020-07-29 03:26:32,897 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@368c4648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:32, skipping insertion in model container [2020-07-29 03:26:32,897 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:32,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:32" (2/3) ... [2020-07-29 03:26:32,898 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@368c4648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:32, skipping insertion in model container [2020-07-29 03:26:32,898 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:32,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:32" (3/3) ... [2020-07-29 03:26:32,900 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2020-07-29 03:26:32,946 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:26:32,947 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:26:32,947 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:26:32,947 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:26:32,947 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:26:32,947 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:26:32,948 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:26:32,948 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:26:32,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 03:26:32,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:26:32,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:32,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:32,991 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:26:32,991 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:32,991 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:26:32,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 03:26:32,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:26:32,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:32,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:32,996 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:26:32,996 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:33,003 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 14#L531true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 17#L531-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;main_~i~1 := 0; 9#L536-3true [2020-07-29 03:26:33,003 INFO L796 eck$LassoCheckResult]: Loop: 9#L536-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 6#L536-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 9#L536-3true [2020-07-29 03:26:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,008 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 03:26:33,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966649358] [2020-07-29 03:26:33,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,141 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:33,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-07-29 03:26:33,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229324370] [2020-07-29 03:26:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,154 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:33,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,169 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-07-29 03:26:33,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997789783] [2020-07-29 03:26:33,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,257 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:33,551 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:33,552 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:33,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:33,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:33,553 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:33,553 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:33,553 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:33,553 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:33,554 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2020-07-29 03:26:33,554 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:33,554 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:33,617 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 03:26:33,629 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 03:26:33,634 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 03:26:33,641 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 03:26:33,647 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 03:26:33,653 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 03:26:33,801 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 03:26:33,807 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 03:26:33,815 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 03:26:34,329 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:34,334 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) [2020-07-29 03:26:34,343 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 03:26:34,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:34,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:34,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:34,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:34,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:34,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:34,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:34,352 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) [2020-07-29 03:26:34,391 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 03:26:34,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:34,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:34,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:34,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:34,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:34,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:34,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:34,397 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) [2020-07-29 03:26:34,435 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 03:26:34,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:34,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:34,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:34,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:34,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:34,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:34,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:34,487 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 03:26:34,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:34,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:34,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:34,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:34,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:34,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:34,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:34,536 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 03:26:34,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:34,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:34,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:34,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:34,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:34,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:34,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:34,542 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) [2020-07-29 03:26:34,581 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 03:26:34,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:34,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:34,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:34,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:34,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:34,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:34,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:34,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:34,621 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 03:26:34,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:34,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:34,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:34,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:34,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:34,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:34,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:34,626 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) [2020-07-29 03:26:34,653 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 03:26:34,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:34,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:34,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:34,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:34,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:34,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:34,681 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:34,741 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 03:26:34,741 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. 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) [2020-07-29 03:26:34,756 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:34,760 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:26:34,760 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:34,761 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1, ULTIMATE.start_main_~i~1) = 1073741819*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [-1*ULTIMATE.start_main_~array_size~0 + 536870910 >= 0] [2020-07-29 03:26:34,917 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 03:26:34,924 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11;" "main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10;" [2020-07-29 03:26:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:34,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:34,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:34,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 03:26:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:34,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:35,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {27#unseeded} is VALID [2020-07-29 03:26:35,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {27#unseeded} is VALID [2020-07-29 03:26:35,029 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {61#(and (>= (+ (* (- 1) ULTIMATE.start_main_~array_size~0) 536870910) 0) unseeded)} is VALID [2020-07-29 03:26:35,030 INFO L280 TraceCheckUtils]: 3: Hoare triple {61#(and (>= (+ (* (- 1) ULTIMATE.start_main_~array_size~0) 536870910) 0) 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;main_~i~1 := 0; {61#(and (>= (+ (* (- 1) ULTIMATE.start_main_~array_size~0) 536870910) 0) unseeded)} is VALID [2020-07-29 03:26:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:35,038 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:26:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:35,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:35,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(and (>= oldRank0 (+ (* 1073741819 (select |#length| ULTIMATE.start_main_~numbers~0.base)) (* (- 8) ULTIMATE.start_main_~i~1))) (>= (+ (* (- 1) ULTIMATE.start_main_~array_size~0) 536870910) 0))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {79#(and (<= 4 (select |#length| ULTIMATE.start_main_~numbers~0.base)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~array_size~0) (<= ULTIMATE.start_main_~array_size~0 536870910) (<= (* 1073741819 (select |#length| ULTIMATE.start_main_~numbers~0.base)) (+ oldRank0 (* 8 ULTIMATE.start_main_~i~1))))} is VALID [2020-07-29 03:26:35,122 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#(and (<= 4 (select |#length| ULTIMATE.start_main_~numbers~0.base)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~array_size~0) (<= ULTIMATE.start_main_~array_size~0 536870910) (<= (* 1073741819 (select |#length| ULTIMATE.start_main_~numbers~0.base)) (+ oldRank0 (* 8 ULTIMATE.start_main_~i~1))))} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {64#(and (or (and (> oldRank0 (+ (* 1073741819 (select |#length| ULTIMATE.start_main_~numbers~0.base)) (* (- 8) ULTIMATE.start_main_~i~1))) (>= oldRank0 0)) unseeded) (>= (+ (* (- 1) ULTIMATE.start_main_~array_size~0) 536870910) 0))} is VALID [2020-07-29 03:26:35,123 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 03:26:35,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:35,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:35,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:35,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,163 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:26:35,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2020-07-29 03:26:35,372 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 41 states and 59 transitions. Complement of second has 8 states. [2020-07-29 03:26:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:35,373 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:35,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 03:26:35,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:26:35,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:35,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:35,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:35,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:35,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:35,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:35,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 59 transitions. [2020-07-29 03:26:35,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:26:35,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:35,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:35,420 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states. [2020-07-29 03:26:35,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:26:35,424 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:26:35,424 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:35,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:35,430 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:35,430 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 59 transitions. cyclomatic complexity: 22 [2020-07-29 03:26:35,432 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:26:35,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:35,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:35,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:35,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:35,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:35,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:35,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:35,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:35,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:35,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:26:35,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:26:35,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:26:35,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:26:35,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:26:35,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:26:35,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:26:35,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:26:35,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:26:35,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:35,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:35,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:35,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:35,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:35,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:35,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:35,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:35,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:35,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:35,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:35,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:35,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:35,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:35,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:35,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:35,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:35,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:35,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:35,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:35,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:35,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:35,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:35,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:35,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:35,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:35,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:35,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:35,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:35,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:35,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:35,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:35,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:26:35,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:35,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:35,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:35,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:35,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:35,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:35,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:35,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:35,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:35,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:35,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:35,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:35,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:35,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:35,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:35,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,494 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-29 03:26:35,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:35,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:35,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:35,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:35,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. cyclomatic complexity: 22 [2020-07-29 03:26:35,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:26:35,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 14 states and 19 transitions. [2020-07-29 03:26:35,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:26:35,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:26:35,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-07-29 03:26:35,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:35,524 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 03:26:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-07-29 03:26:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-29 03:26:35,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:35,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand 14 states. [2020-07-29 03:26:35,559 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand 14 states. [2020-07-29 03:26:35,562 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 14 states. [2020-07-29 03:26:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:35,568 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 03:26:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 03:26:35,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:35,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:35,569 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states and 19 transitions. [2020-07-29 03:26:35,569 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states and 19 transitions. [2020-07-29 03:26:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:35,574 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 03:26:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 03:26:35,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:35,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:35,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:35,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 03:26:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-07-29 03:26:35,586 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 03:26:35,586 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 03:26:35,586 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:35,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-07-29 03:26:35,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:26:35,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:35,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:35,591 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:26:35,591 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:35,591 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 146#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 147#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 150#L531-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;main_~i~1 := 0; 144#L536-3 assume !(main_~i~1 < main_~array_size~0); 145#L536-4 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; 141#L515-3 [2020-07-29 03:26:35,591 INFO L796 eck$LassoCheckResult]: Loop: 141#L515-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; 137#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 138#L519-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); 140#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 141#L515-3 [2020-07-29 03:26:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-07-29 03:26:35,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:35,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066850885] [2020-07-29 03:26:35,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:35,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {182#true} is VALID [2020-07-29 03:26:35,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {182#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {182#true} is VALID [2020-07-29 03:26:35,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {182#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {184#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:35,690 INFO L280 TraceCheckUtils]: 3: Hoare triple {184#(<= 1 ULTIMATE.start_main_~array_size~0)} 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;main_~i~1 := 0; {185#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~i~1))} is VALID [2020-07-29 03:26:35,691 INFO L280 TraceCheckUtils]: 4: Hoare triple {185#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~i~1))} assume !(main_~i~1 < main_~array_size~0); {183#false} is VALID [2020-07-29 03:26:35,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {183#false} 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; {183#false} is VALID [2020-07-29 03:26:35,692 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 03:26:35,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066850885] [2020-07-29 03:26:35,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:35,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:26:35,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267412106] [2020-07-29 03:26:35,697 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2020-07-29 03:26:35,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:35,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232808303] [2020-07-29 03:26:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:35,721 INFO L280 TraceCheckUtils]: 0: Hoare triple {186#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; {188#(<= (+ ULTIMATE.start_SelectionSort_~j~0 1) ULTIMATE.start_SelectionSort_~array_size)} is VALID [2020-07-29 03:26:35,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {188#(<= (+ ULTIMATE.start_SelectionSort_~j~0 1) ULTIMATE.start_SelectionSort_~array_size)} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {187#false} is VALID [2020-07-29 03:26:35,723 INFO L280 TraceCheckUtils]: 2: Hoare triple {187#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); {187#false} is VALID [2020-07-29 03:26:35,723 INFO L280 TraceCheckUtils]: 3: Hoare triple {187#false} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {187#false} is VALID [2020-07-29 03:26:35,723 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 03:26:35,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232808303] [2020-07-29 03:26:35,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:35,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:26:35,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964674963] [2020-07-29 03:26:35,725 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:26:35,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:35,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:26:35,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:26:35,728 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 03:26:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:35,769 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 03:26:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:26:35,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:35,776 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 03:26:35,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2020-07-29 03:26:35,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:35,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 03:26:35,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:26:35,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:26:35,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-07-29 03:26:35,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:35,779 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:26:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-07-29 03:26:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 03:26:35,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:35,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 03:26:35,781 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 03:26:35,781 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 03:26:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:35,782 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 03:26:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:26:35,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:35,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:35,783 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 03:26:35,783 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 03:26:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:35,784 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 03:26:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:26:35,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:35,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:35,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:35,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 03:26:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 03:26:35,786 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:26:35,786 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:26:35,787 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:35,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:26:35,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:35,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:35,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:35,788 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:26:35,788 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:35,788 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 213#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 214#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 217#L531-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;main_~i~1 := 0; 211#L536-3 assume !(main_~i~1 < main_~array_size~0); 212#L536-4 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; 208#L515-3 [2020-07-29 03:26:35,788 INFO L796 eck$LassoCheckResult]: Loop: 208#L515-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; 204#L519-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); 205#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 215#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 218#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 206#L519-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); 207#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 208#L515-3 [2020-07-29 03:26:35,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2020-07-29 03:26:35,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:35,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863678479] [2020-07-29 03:26:35,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:35,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {252#true} is VALID [2020-07-29 03:26:35,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {252#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {252#true} is VALID [2020-07-29 03:26:35,852 INFO L280 TraceCheckUtils]: 2: Hoare triple {252#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {254#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:35,853 INFO L280 TraceCheckUtils]: 3: Hoare triple {254#(<= 1 ULTIMATE.start_main_~array_size~0)} 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;main_~i~1 := 0; {255#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~i~1))} is VALID [2020-07-29 03:26:35,854 INFO L280 TraceCheckUtils]: 4: Hoare triple {255#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~i~1))} assume !(main_~i~1 < main_~array_size~0); {253#false} is VALID [2020-07-29 03:26:35,854 INFO L280 TraceCheckUtils]: 5: Hoare triple {253#false} 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; {253#false} is VALID [2020-07-29 03:26:35,855 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 03:26:35,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863678479] [2020-07-29 03:26:35,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:35,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:26:35,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259345627] [2020-07-29 03:26:35,856 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:35,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:35,856 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2020-07-29 03:26:35,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:35,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734281780] [2020-07-29 03:26:35,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:35,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:35,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:35,893 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:36,041 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-07-29 03:26:36,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:26:36,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:26:36,105 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 03:26:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:36,165 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 03:26:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:26:36,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:36,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:36,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2020-07-29 03:26:36,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:36,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2020-07-29 03:26:36,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:26:36,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:26:36,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2020-07-29 03:26:36,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:36,178 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 03:26:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2020-07-29 03:26:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-29 03:26:36,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:36,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 20 transitions. Second operand 15 states. [2020-07-29 03:26:36,179 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 20 transitions. Second operand 15 states. [2020-07-29 03:26:36,179 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 15 states. [2020-07-29 03:26:36,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:36,181 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 03:26:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-29 03:26:36,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:36,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:36,181 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states and 20 transitions. [2020-07-29 03:26:36,181 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states and 20 transitions. [2020-07-29 03:26:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:36,183 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 03:26:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-29 03:26:36,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:36,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:36,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:36,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 03:26:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-07-29 03:26:36,184 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 03:26:36,184 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 03:26:36,184 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:26:36,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-07-29 03:26:36,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:36,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:36,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:36,186 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:36,186 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:36,186 INFO L794 eck$LassoCheckResult]: Stem: 286#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 283#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 284#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 287#L531-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;main_~i~1 := 0; 281#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 279#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 280#L536-3 assume !(main_~i~1 < main_~array_size~0); 282#L536-4 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; 278#L515-3 [2020-07-29 03:26:36,186 INFO L796 eck$LassoCheckResult]: Loop: 278#L515-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; 274#L519-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); 275#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 285#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 288#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 276#L519-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 277#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 278#L515-3 [2020-07-29 03:26:36,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:36,186 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-07-29 03:26:36,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:36,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827563344] [2020-07-29 03:26:36,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:36,199 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:36,210 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:36,214 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:36,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:36,215 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2020-07-29 03:26:36,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:36,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525671236] [2020-07-29 03:26:36,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:36,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:36,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:36,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:36,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:36,241 INFO L82 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2020-07-29 03:26:36,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:36,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464991853] [2020-07-29 03:26:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:36,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {328#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {328#true} is VALID [2020-07-29 03:26:36,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {328#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {328#true} is VALID [2020-07-29 03:26:36,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {328#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {328#true} is VALID [2020-07-29 03:26:36,371 INFO L280 TraceCheckUtils]: 3: Hoare triple {328#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;main_~i~1 := 0; {330#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:36,372 INFO L280 TraceCheckUtils]: 4: Hoare triple {330#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {330#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:36,373 INFO L280 TraceCheckUtils]: 5: Hoare triple {330#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {331#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:36,375 INFO L280 TraceCheckUtils]: 6: Hoare triple {331#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < main_~array_size~0); {332#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:26:36,376 INFO L280 TraceCheckUtils]: 7: Hoare triple {332#(<= ULTIMATE.start_main_~array_size~0 1)} 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; {333#(and (= 0 ULTIMATE.start_SelectionSort_~i~0) (<= ULTIMATE.start_SelectionSort_~array_size 1))} is VALID [2020-07-29 03:26:36,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {333#(and (= 0 ULTIMATE.start_SelectionSort_~i~0) (<= ULTIMATE.start_SelectionSort_~array_size 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; {329#false} is VALID [2020-07-29 03:26:36,377 INFO L280 TraceCheckUtils]: 9: Hoare triple {329#false} 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); {329#false} is VALID [2020-07-29 03:26:36,377 INFO L280 TraceCheckUtils]: 10: Hoare triple {329#false} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; {329#false} is VALID [2020-07-29 03:26:36,378 INFO L280 TraceCheckUtils]: 11: Hoare triple {329#false} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {329#false} is VALID [2020-07-29 03:26:36,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {329#false} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {329#false} is VALID [2020-07-29 03:26:36,378 INFO L280 TraceCheckUtils]: 13: Hoare triple {329#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); {329#false} is VALID [2020-07-29 03:26:36,378 INFO L280 TraceCheckUtils]: 14: Hoare triple {329#false} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {329#false} is VALID [2020-07-29 03:26:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:36,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464991853] [2020-07-29 03:26:36,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405872946] [2020-07-29 03:26:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:36,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:26:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:36,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:36,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {328#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {328#true} is VALID [2020-07-29 03:26:36,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {328#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {328#true} is VALID [2020-07-29 03:26:36,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {328#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {328#true} is VALID [2020-07-29 03:26:36,591 INFO L280 TraceCheckUtils]: 3: Hoare triple {328#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;main_~i~1 := 0; {346#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:36,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {346#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {346#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:36,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {346#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {331#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:36,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {331#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < main_~array_size~0); {332#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:26:36,595 INFO L280 TraceCheckUtils]: 7: Hoare triple {332#(<= ULTIMATE.start_main_~array_size~0 1)} 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; {359#(and (<= 0 ULTIMATE.start_SelectionSort_~i~0) (<= ULTIMATE.start_SelectionSort_~array_size 1))} is VALID [2020-07-29 03:26:36,596 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(and (<= 0 ULTIMATE.start_SelectionSort_~i~0) (<= ULTIMATE.start_SelectionSort_~array_size 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; {329#false} is VALID [2020-07-29 03:26:36,597 INFO L280 TraceCheckUtils]: 9: Hoare triple {329#false} 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); {329#false} is VALID [2020-07-29 03:26:36,597 INFO L280 TraceCheckUtils]: 10: Hoare triple {329#false} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; {329#false} is VALID [2020-07-29 03:26:36,597 INFO L280 TraceCheckUtils]: 11: Hoare triple {329#false} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {329#false} is VALID [2020-07-29 03:26:36,597 INFO L280 TraceCheckUtils]: 12: Hoare triple {329#false} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {329#false} is VALID [2020-07-29 03:26:36,598 INFO L280 TraceCheckUtils]: 13: Hoare triple {329#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); {329#false} is VALID [2020-07-29 03:26:36,598 INFO L280 TraceCheckUtils]: 14: Hoare triple {329#false} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {329#false} is VALID [2020-07-29 03:26:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:36,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:36,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-29 03:26:36,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752548608] [2020-07-29 03:26:36,735 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-07-29 03:26:36,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:36,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 03:26:36,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-29 03:26:36,794 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 8 states. [2020-07-29 03:26:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:36,994 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2020-07-29 03:26:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:26:36,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:26:37,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:37,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2020-07-29 03:26:37,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:37,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 21 transitions. [2020-07-29 03:26:37,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:26:37,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:26:37,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-07-29 03:26:37,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:37,028 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-29 03:26:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-07-29 03:26:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 03:26:37,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:37,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 03:26:37,030 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 03:26:37,030 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 03:26:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:37,032 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-29 03:26:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-29 03:26:37,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:37,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:37,033 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states and 21 transitions. [2020-07-29 03:26:37,033 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states and 21 transitions. [2020-07-29 03:26:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:37,034 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-29 03:26:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-29 03:26:37,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:37,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:37,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:37,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:26:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-07-29 03:26:37,038 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 03:26:37,038 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 03:26:37,038 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:26:37,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-07-29 03:26:37,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:37,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:37,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:37,040 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:37,040 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:37,040 INFO L794 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 421#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 422#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 425#L531-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;main_~i~1 := 0; 418#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 416#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 417#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 419#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 427#L536-3 assume !(main_~i~1 < main_~array_size~0); 420#L536-4 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; 415#L515-3 [2020-07-29 03:26:37,041 INFO L796 eck$LassoCheckResult]: Loop: 415#L515-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; 411#L519-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); 412#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 423#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 426#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 413#L519-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); 414#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 415#L515-3 [2020-07-29 03:26:37,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:37,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2020-07-29 03:26:37,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:37,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963603235] [2020-07-29 03:26:37,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,068 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,072 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:37,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2020-07-29 03:26:37,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:37,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046075867] [2020-07-29 03:26:37,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,085 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,098 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:37,098 INFO L82 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2020-07-29 03:26:37,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:37,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912689334] [2020-07-29 03:26:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:37,342 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-07-29 03:26:37,640 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2020-07-29 03:26:37,766 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:37,767 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:37,767 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:37,767 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:37,767 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:37,767 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:37,767 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:37,768 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:37,768 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2020-07-29 03:26:37,768 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:37,768 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:37,812 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 03:26:38,005 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2020-07-29 03:26:38,155 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:38,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 03:26:38,164 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 03:26:38,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 03:26:38,174 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 03:26:38,178 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 03:26:38,182 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 03:26:38,187 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 03:26:38,192 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 03:26:38,197 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 03:26:38,200 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 03:26:38,204 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 03:26:38,207 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 03:26:38,212 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 03:26:38,216 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 03:26:38,221 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 03:26:38,550 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-07-29 03:26:39,011 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:39,013 INFO L489 LassoAnalysis]: Using template 'affine'. 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 03:26:39,025 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 03:26:39,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:39,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:39,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:39,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:39,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:39,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:39,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:39,032 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 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 03:26:39,059 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 03:26:39,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:39,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:39,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:39,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:39,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:39,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:39,108 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:39,202 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2020-07-29 03:26:39,202 INFO L444 ModelExtractionUtils]: 18 out of 46 variables were initially zero. Simplification set additionally 25 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:39,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:39,217 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:39,218 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:39,218 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~i~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2020-07-29 03:26:39,287 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:26:39,292 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~mem5;havoc SelectionSort_#t~mem4;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 03:26:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:39,350 INFO L280 TraceCheckUtils]: 0: Hoare triple {473#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {473#unseeded} is VALID [2020-07-29 03:26:39,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {473#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {473#unseeded} is VALID [2020-07-29 03:26:39,352 INFO L280 TraceCheckUtils]: 2: Hoare triple {473#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {473#unseeded} is VALID [2020-07-29 03:26:39,353 INFO L280 TraceCheckUtils]: 3: Hoare triple {473#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;main_~i~1 := 0; {473#unseeded} is VALID [2020-07-29 03:26:39,353 INFO L280 TraceCheckUtils]: 4: Hoare triple {473#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {473#unseeded} is VALID [2020-07-29 03:26:39,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {473#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {473#unseeded} is VALID [2020-07-29 03:26:39,355 INFO L280 TraceCheckUtils]: 6: Hoare triple {473#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {473#unseeded} is VALID [2020-07-29 03:26:39,355 INFO L280 TraceCheckUtils]: 7: Hoare triple {473#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {473#unseeded} is VALID [2020-07-29 03:26:39,356 INFO L280 TraceCheckUtils]: 8: Hoare triple {473#unseeded} assume !(main_~i~1 < main_~array_size~0); {473#unseeded} is VALID [2020-07-29 03:26:39,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {473#unseeded} 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; {473#unseeded} is VALID [2020-07-29 03:26:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:39,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {476#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~i~0) ULTIMATE.start_SelectionSort_~array_size))} 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; {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:26:39,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~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); {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:26:39,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:26:39,405 INFO L280 TraceCheckUtils]: 3: Hoare triple {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~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; {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:26:39,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:26:39,407 INFO L280 TraceCheckUtils]: 5: Hoare triple {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~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); {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:26:39,409 INFO L280 TraceCheckUtils]: 6: Hoare triple {548#(and (< (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~array_size) (<= ULTIMATE.start_SelectionSort_~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; {516#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~i~0) ULTIMATE.start_SelectionSort_~array_size)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:39,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:39,422 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 03:26:39,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:39,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,423 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 03:26:39,423 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 03:26:39,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 24 states and 30 transitions. Complement of second has 4 states. [2020-07-29 03:26:39,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:39,471 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:39,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:39,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:39,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:39,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2020-07-29 03:26:39,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:39,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,476 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:39,478 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:39,478 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:39,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:39,479 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:39,479 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:39,480 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:39,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:39,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:39,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:39,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:26:39,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:26:39,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:26:39,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:26:39,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:26:39,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:26:39,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:39,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:39,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:39,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:39,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:39,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:39,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 7 letters. [2020-07-29 03:26:39,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 7 letters. [2020-07-29 03:26:39,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 7 letters. [2020-07-29 03:26:39,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:39,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:39,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:39,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 7 letters. [2020-07-29 03:26:39,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 03:26:39,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 7 letters. [2020-07-29 03:26:39,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:39,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:39,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:39,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:39,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:39,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:39,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,503 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-29 03:26:39,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:39,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2020-07-29 03:26:39,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 14 letters. [2020-07-29 03:26:39,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:39,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:39,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 28 transitions. [2020-07-29 03:26:39,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:26:39,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 03:26:39,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2020-07-29 03:26:39,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:39,508 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 03:26:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2020-07-29 03:26:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-29 03:26:39,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:39,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 28 transitions. Second operand 21 states. [2020-07-29 03:26:39,511 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 28 transitions. Second operand 21 states. [2020-07-29 03:26:39,511 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 21 states. [2020-07-29 03:26:39,512 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:39,515 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 03:26:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 03:26:39,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:39,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:39,517 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states and 28 transitions. [2020-07-29 03:26:39,517 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states and 28 transitions. [2020-07-29 03:26:39,518 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:39,519 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 03:26:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 03:26:39,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:39,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:39,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:39,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 03:26:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2020-07-29 03:26:39,523 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-07-29 03:26:39,523 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-07-29 03:26:39,523 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:26:39,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2020-07-29 03:26:39,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:39,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,524 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:39,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:39,525 INFO L794 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 609#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 610#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 615#L531-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;main_~i~1 := 0; 607#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 604#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 605#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 608#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 617#L536-3 assume !(main_~i~1 < main_~array_size~0); 611#L536-4 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; 606#L515-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; 597#L519-3 [2020-07-29 03:26:39,525 INFO L796 eck$LassoCheckResult]: Loop: 597#L519-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); 598#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 612#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 597#L519-3 [2020-07-29 03:26:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2020-07-29 03:26:39,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064485434] [2020-07-29 03:26:39,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,549 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-07-29 03:26:39,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103097909] [2020-07-29 03:26:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,557 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,564 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,565 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2020-07-29 03:26:39,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907198900] [2020-07-29 03:26:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,621 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,913 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2020-07-29 03:26:40,043 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:40,043 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:40,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:40,044 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:40,044 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:40,044 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,044 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:40,044 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:40,045 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2020-07-29 03:26:40,045 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:40,045 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:40,080 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 03:26:40,084 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 03:26:40,087 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 03:26:40,091 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 03:26:40,095 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 03:26:40,099 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 03:26:40,112 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 03:26:40,115 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 03:26:40,120 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 03:26:40,123 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 03:26:40,281 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-07-29 03:26:40,373 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:40,379 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 03:26:40,383 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 03:26:40,386 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 03:26:40,389 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 03:26:40,398 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 03:26:40,402 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 03:26:40,404 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 03:26:40,834 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-07-29 03:26:41,255 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:41,256 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 03:26:41,262 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 03:26:41,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,267 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,292 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 03:26:41,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:26:41,322 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 03:26:41,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:41,328 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 03:26:41,354 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 03:26:41,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,359 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) [2020-07-29 03:26:41,404 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 03:26:41,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,416 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 03:26:41,441 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 03:26:41,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,445 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 03:26:41,469 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 03:26:41,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,472 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 03:26:41,496 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 03:26:41,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:41,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,527 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 03:26:41,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,556 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 03:26:41,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:41,570 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 03:26:41,617 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 03:26:41,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,620 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 03:26:41,624 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) [2020-07-29 03:26:41,663 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 03:26:41,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,674 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,710 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 03:26:41,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:41,741 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:41,774 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 03:26:41,774 INFO L444 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. 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 03:26:41,778 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:41,780 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:26:41,780 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:41,780 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2, ULTIMATE.start_SelectionSort_~min~0, ULTIMATE.start_SelectionSort_~a.offset) = 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 - 4*ULTIMATE.start_SelectionSort_~min~0 - 1*ULTIMATE.start_SelectionSort_~a.offset Supporting invariants [1*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~min~0 - 1 >= 0] [2020-07-29 03:26:41,836 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2020-07-29 03:26:41,846 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~mem5;havoc SelectionSort_#t~mem4;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 03:26:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:41,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:41,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:41,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:41,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:41,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {733#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {733#unseeded} is VALID [2020-07-29 03:26:41,914 INFO L280 TraceCheckUtils]: 1: Hoare triple {733#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {733#unseeded} is VALID [2020-07-29 03:26:41,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {733#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {733#unseeded} is VALID [2020-07-29 03:26:41,915 INFO L280 TraceCheckUtils]: 3: Hoare triple {733#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;main_~i~1 := 0; {733#unseeded} is VALID [2020-07-29 03:26:41,916 INFO L280 TraceCheckUtils]: 4: Hoare triple {733#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {733#unseeded} is VALID [2020-07-29 03:26:41,918 INFO L280 TraceCheckUtils]: 5: Hoare triple {733#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {733#unseeded} is VALID [2020-07-29 03:26:41,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {733#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {733#unseeded} is VALID [2020-07-29 03:26:41,918 INFO L280 TraceCheckUtils]: 7: Hoare triple {733#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {733#unseeded} is VALID [2020-07-29 03:26:41,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {733#unseeded} assume !(main_~i~1 < main_~array_size~0); {733#unseeded} is VALID [2020-07-29 03:26:41,919 INFO L280 TraceCheckUtils]: 9: Hoare triple {733#unseeded} 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; {733#unseeded} is VALID [2020-07-29 03:26:41,924 INFO L280 TraceCheckUtils]: 10: Hoare triple {733#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; {782#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) unseeded)} is VALID [2020-07-29 03:26:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:41,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:26:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:41,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:42,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {783#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (>= oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 4) ULTIMATE.start_SelectionSort_~min~0) (* (- 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); {821#(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 03:26:42,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#(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~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; {825#(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 03:26:42,037 INFO L280 TraceCheckUtils]: 2: Hoare triple {825#(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; {785#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 4) ULTIMATE.start_SelectionSort_~min~0) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset))))))} is VALID [2020-07-29 03:26:42,037 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 03:26:42,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:42,058 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 03:26:42,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,058 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 03:26:42,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 03:26:42,246 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 45 states and 57 transitions. Complement of second has 8 states. [2020-07-29 03:26:42,247 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 03:26:42,247 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:42,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:42,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:42,248 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:42,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:42,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 57 transitions. [2020-07-29 03:26:42,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:42,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,250 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 27 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:42,250 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:42,250 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:42,251 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:42,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 17 transitions. cyclomatic complexity: 14 [2020-07-29 03:26:42,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:42,251 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:26:42,251 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 57 transitions. cyclomatic complexity: 19 [2020-07-29 03:26:42,252 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:26:42,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:42,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:42,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:42,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:42,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:42,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:42,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:42,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:42,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:42,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:42,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:42,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:42,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:42,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:42,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:42,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:42,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:42,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:42,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:42,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:42,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:42,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:42,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:42,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:42,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:42,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:42,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:42,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 57 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,264 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-07-29 03:26:42,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,265 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:26:42,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:42,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {733#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {733#unseeded} is VALID [2020-07-29 03:26:42,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {733#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {733#unseeded} is VALID [2020-07-29 03:26:42,338 INFO L280 TraceCheckUtils]: 2: Hoare triple {733#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {733#unseeded} is VALID [2020-07-29 03:26:42,339 INFO L280 TraceCheckUtils]: 3: Hoare triple {733#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;main_~i~1 := 0; {733#unseeded} is VALID [2020-07-29 03:26:42,339 INFO L280 TraceCheckUtils]: 4: Hoare triple {733#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {733#unseeded} is VALID [2020-07-29 03:26:42,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {733#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {733#unseeded} is VALID [2020-07-29 03:26:42,340 INFO L280 TraceCheckUtils]: 6: Hoare triple {733#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {733#unseeded} is VALID [2020-07-29 03:26:42,341 INFO L280 TraceCheckUtils]: 7: Hoare triple {733#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {733#unseeded} is VALID [2020-07-29 03:26:42,342 INFO L280 TraceCheckUtils]: 8: Hoare triple {733#unseeded} assume !(main_~i~1 < main_~array_size~0); {733#unseeded} is VALID [2020-07-29 03:26:42,342 INFO L280 TraceCheckUtils]: 9: Hoare triple {733#unseeded} 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; {733#unseeded} is VALID [2020-07-29 03:26:42,343 INFO L280 TraceCheckUtils]: 10: Hoare triple {733#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; {782#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) unseeded)} is VALID [2020-07-29 03:26:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:26:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:42,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {783#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (>= oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 4) ULTIMATE.start_SelectionSort_~min~0) (* (- 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); {926#(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 03:26:42,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {926#(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~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; {930#(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 03:26:42,449 INFO L280 TraceCheckUtils]: 2: Hoare triple {930#(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; {785#(and (>= (+ ULTIMATE.start_SelectionSort_~j~0 (* (- 1) ULTIMATE.start_SelectionSort_~min~0) (- 1)) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* (- 4) ULTIMATE.start_SelectionSort_~min~0) (* (- 1) ULTIMATE.start_SelectionSort_~a.offset))))))} is VALID [2020-07-29 03:26:42,449 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 03:26:42,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:42,464 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 03:26:42,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,465 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 03:26:42,465 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 03:26:42,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 48 states and 65 transitions. Complement of second has 9 states. [2020-07-29 03:26:42,628 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 03:26:42,628 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:42,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:42,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:42,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:42,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 65 transitions. [2020-07-29 03:26:42,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:42,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,632 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 27 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:42,633 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:42,633 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:42,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:42,636 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:42,636 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 65 transitions. cyclomatic complexity: 24 [2020-07-29 03:26:42,637 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:26:42,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:42,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:42,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:42,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:26:42,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:26:42,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:26:42,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:42,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:42,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:42,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:42,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:42,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:42,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:42,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:42,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:42,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:42,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:42,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:42,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:42,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:42,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:42,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:42,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:42,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:42,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:42,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:42,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:42,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:42,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:42,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:42,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:42,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:42,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:42,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 65 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:42,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,651 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 03:26:42,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:42,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:42,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 6 letters. [2020-07-29 03:26:42,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. cyclomatic complexity: 24 [2020-07-29 03:26:42,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:42,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 58 transitions. [2020-07-29 03:26:42,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 03:26:42,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 03:26:42,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 58 transitions. [2020-07-29 03:26:42,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:42,658 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-07-29 03:26:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 58 transitions. [2020-07-29 03:26:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2020-07-29 03:26:42,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:42,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 58 transitions. Second operand 39 states. [2020-07-29 03:26:42,665 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 58 transitions. Second operand 39 states. [2020-07-29 03:26:42,665 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 39 states. [2020-07-29 03:26:42,666 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:42,668 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2020-07-29 03:26:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2020-07-29 03:26:42,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:42,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:42,669 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states and 58 transitions. [2020-07-29 03:26:42,669 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states and 58 transitions. [2020-07-29 03:26:42,670 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:42,672 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2020-07-29 03:26:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2020-07-29 03:26:42,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:42,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:42,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:42,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 03:26:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-07-29 03:26:42,675 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-07-29 03:26:42,675 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-07-29 03:26:42,675 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:26:42,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2020-07-29 03:26:42,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:42,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,677 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:42,677 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:42,677 INFO L794 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1012#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1013#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1019#L531-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;main_~i~1 := 0; 1010#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1004#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1005#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1011#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1022#L536-3 assume !(main_~i~1 < main_~array_size~0); 1014#L536-4 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; 1006#L515-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; 1007#L519-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); 998#L521 [2020-07-29 03:26:42,677 INFO L796 eck$LassoCheckResult]: Loop: 998#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1015#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 997#L519-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); 998#L521 [2020-07-29 03:26:42,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash -304736135, now seen corresponding path program 1 times [2020-07-29 03:26:42,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135827229] [2020-07-29 03:26:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash 73540, now seen corresponding path program 1 times [2020-07-29 03:26:42,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025898825] [2020-07-29 03:26:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,709 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,713 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1166709708, now seen corresponding path program 1 times [2020-07-29 03:26:42,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223934812] [2020-07-29 03:26:42,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {1212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1212#true} is VALID [2020-07-29 03:26:42,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {1212#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1212#true} is VALID [2020-07-29 03:26:42,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {1212#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1212#true} is VALID [2020-07-29 03:26:42,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {1212#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;main_~i~1 := 0; {1214#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:42,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {1214#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1214#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:42,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {1214#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1215#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:42,819 INFO L280 TraceCheckUtils]: 6: Hoare triple {1215#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1215#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:42,820 INFO L280 TraceCheckUtils]: 7: Hoare triple {1215#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1216#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:26:42,821 INFO L280 TraceCheckUtils]: 8: Hoare triple {1216#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < main_~array_size~0); {1217#(<= ULTIMATE.start_main_~array_size~0 2)} is VALID [2020-07-29 03:26:42,822 INFO L280 TraceCheckUtils]: 9: Hoare triple {1217#(<= ULTIMATE.start_main_~array_size~0 2)} 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; {1218#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (= 0 ULTIMATE.start_SelectionSort_~i~0))} is VALID [2020-07-29 03:26:42,825 INFO L280 TraceCheckUtils]: 10: Hoare triple {1218#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (= 0 ULTIMATE.start_SelectionSort_~i~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; {1219#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~j~0 1))} is VALID [2020-07-29 03:26:42,826 INFO L280 TraceCheckUtils]: 11: Hoare triple {1219#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~j~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); {1219#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~j~0 1))} is VALID [2020-07-29 03:26:42,827 INFO L280 TraceCheckUtils]: 12: Hoare triple {1219#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~j~0 1))} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; {1219#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~j~0 1))} is VALID [2020-07-29 03:26:42,829 INFO L280 TraceCheckUtils]: 13: Hoare triple {1219#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~j~0 1))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1220#(<= ULTIMATE.start_SelectionSort_~array_size ULTIMATE.start_SelectionSort_~j~0)} is VALID [2020-07-29 03:26:42,834 INFO L280 TraceCheckUtils]: 14: Hoare triple {1220#(<= ULTIMATE.start_SelectionSort_~array_size ULTIMATE.start_SelectionSort_~j~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); {1213#false} is VALID [2020-07-29 03:26:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:42,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223934812] [2020-07-29 03:26:42,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757907673] [2020-07-29 03:26:42,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:43,106 INFO L280 TraceCheckUtils]: 0: Hoare triple {1212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1212#true} is VALID [2020-07-29 03:26:43,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {1212#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1212#true} is VALID [2020-07-29 03:26:43,106 INFO L280 TraceCheckUtils]: 2: Hoare triple {1212#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1212#true} is VALID [2020-07-29 03:26:43,107 INFO L280 TraceCheckUtils]: 3: Hoare triple {1212#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;main_~i~1 := 0; {1233#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:43,108 INFO L280 TraceCheckUtils]: 4: Hoare triple {1233#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1233#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:43,109 INFO L280 TraceCheckUtils]: 5: Hoare triple {1233#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1215#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:43,109 INFO L280 TraceCheckUtils]: 6: Hoare triple {1215#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1215#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:43,110 INFO L280 TraceCheckUtils]: 7: Hoare triple {1215#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1216#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:26:43,117 INFO L280 TraceCheckUtils]: 8: Hoare triple {1216#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < main_~array_size~0); {1217#(<= ULTIMATE.start_main_~array_size~0 2)} is VALID [2020-07-29 03:26:43,118 INFO L280 TraceCheckUtils]: 9: Hoare triple {1217#(<= ULTIMATE.start_main_~array_size~0 2)} 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; {1252#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (<= 0 ULTIMATE.start_SelectionSort_~i~0))} is VALID [2020-07-29 03:26:43,119 INFO L280 TraceCheckUtils]: 10: Hoare triple {1252#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (<= 0 ULTIMATE.start_SelectionSort_~i~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; {1256#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (<= 1 ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 03:26:43,120 INFO L280 TraceCheckUtils]: 11: Hoare triple {1256#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (<= 1 ULTIMATE.start_SelectionSort_~j~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); {1256#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (<= 1 ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 03:26:43,121 INFO L280 TraceCheckUtils]: 12: Hoare triple {1256#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (<= 1 ULTIMATE.start_SelectionSort_~j~0))} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; {1256#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (<= 1 ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 03:26:43,121 INFO L280 TraceCheckUtils]: 13: Hoare triple {1256#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (<= 1 ULTIMATE.start_SelectionSort_~j~0))} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1266#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (<= 2 ULTIMATE.start_SelectionSort_~j~0))} is VALID [2020-07-29 03:26:43,123 INFO L280 TraceCheckUtils]: 14: Hoare triple {1266#(and (<= ULTIMATE.start_SelectionSort_~array_size 2) (<= 2 ULTIMATE.start_SelectionSort_~j~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); {1213#false} is VALID [2020-07-29 03:26:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:43,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:43,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-07-29 03:26:43,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435571926] [2020-07-29 03:26:43,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 03:26:43,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-29 03:26:43,187 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. cyclomatic complexity: 21 Second operand 13 states. [2020-07-29 03:26:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:43,619 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2020-07-29 03:26:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 03:26:43,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:26:43,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:43,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 91 transitions. [2020-07-29 03:26:43,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:43,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 42 states and 56 transitions. [2020-07-29 03:26:43,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 03:26:43,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:26:43,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2020-07-29 03:26:43,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:43,659 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2020-07-29 03:26:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2020-07-29 03:26:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-29 03:26:43,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:43,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 56 transitions. Second operand 41 states. [2020-07-29 03:26:43,662 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 56 transitions. Second operand 41 states. [2020-07-29 03:26:43,662 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand 41 states. [2020-07-29 03:26:43,663 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:43,665 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2020-07-29 03:26:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2020-07-29 03:26:43,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:43,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:43,666 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states and 56 transitions. [2020-07-29 03:26:43,666 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states and 56 transitions. [2020-07-29 03:26:43,666 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:43,669 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2020-07-29 03:26:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2020-07-29 03:26:43,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:43,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:43,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:43,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:43,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 03:26:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2020-07-29 03:26:43,671 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2020-07-29 03:26:43,671 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2020-07-29 03:26:43,672 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:26:43,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 55 transitions. [2020-07-29 03:26:43,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:43,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:43,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:43,673 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:43,673 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:43,673 INFO L794 eck$LassoCheckResult]: Stem: 1372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1367#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1368#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1373#L531-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;main_~i~1 := 0; 1363#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1364#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1365#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1357#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1358#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1378#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1377#L536-3 assume !(main_~i~1 < main_~array_size~0); 1366#L536-4 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; 1359#L515-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; 1361#L519-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); 1351#L521 [2020-07-29 03:26:43,673 INFO L796 eck$LassoCheckResult]: Loop: 1351#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1369#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1350#L519-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); 1351#L521 [2020-07-29 03:26:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash -740576421, now seen corresponding path program 2 times [2020-07-29 03:26:43,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:43,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505112407] [2020-07-29 03:26:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:43,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:43,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:43,730 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:43,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash 73540, now seen corresponding path program 2 times [2020-07-29 03:26:43,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:43,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851703840] [2020-07-29 03:26:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:43,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:43,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:43,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash 734885290, now seen corresponding path program 2 times [2020-07-29 03:26:43,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:43,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004755274] [2020-07-29 03:26:43,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:43,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:43,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:43,804 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:44,278 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 104 [2020-07-29 03:26:44,428 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:44,428 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:44,428 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:44,429 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:44,429 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:44,429 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,429 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:44,429 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:44,429 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration8_Lasso [2020-07-29 03:26:44,429 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:44,430 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:44,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 03:26:44,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 03:26:44,641 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-07-29 03:26:44,678 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 03:26:44,682 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 03:26:44,685 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 03:26:44,688 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 03:26:44,691 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 03:26:44,695 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 03:26:44,698 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 03:26:44,701 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 03:26:44,704 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 03:26:44,709 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 03:26:44,712 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 03:26:44,715 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 03:26:44,718 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 03:26:44,721 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 03:26:45,385 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:45,385 INFO L489 LassoAnalysis]: Using template 'affine'. 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 03:26:45,391 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 03:26:45,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:45,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:45,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:45,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:45,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:45,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:45,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:45,394 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:45,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 03:26:45,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:45,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:45,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:45,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:45,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:45,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:45,426 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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:45,447 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 03:26:45,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:45,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:45,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:45,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:45,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:45,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:45,459 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 03:26:45,481 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 03:26:45,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:45,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:45,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:45,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:45,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:45,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:45,509 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:45,527 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 03:26:45,527 INFO L444 ModelExtractionUtils]: 27 out of 43 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 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 03:26:45,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:45,530 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:45,531 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:45,531 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 03:26:45,564 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:26:45,567 INFO L393 LassoCheck]: Loop: "assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;" "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 03:26:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:45,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:45,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:45,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:45,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {1571#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1571#unseeded} is VALID [2020-07-29 03:26:45,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {1571#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1571#unseeded} is VALID [2020-07-29 03:26:45,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {1571#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1571#unseeded} is VALID [2020-07-29 03:26:45,623 INFO L280 TraceCheckUtils]: 3: Hoare triple {1571#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;main_~i~1 := 0; {1571#unseeded} is VALID [2020-07-29 03:26:45,624 INFO L280 TraceCheckUtils]: 4: Hoare triple {1571#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1571#unseeded} is VALID [2020-07-29 03:26:45,624 INFO L280 TraceCheckUtils]: 5: Hoare triple {1571#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1571#unseeded} is VALID [2020-07-29 03:26:45,625 INFO L280 TraceCheckUtils]: 6: Hoare triple {1571#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1571#unseeded} is VALID [2020-07-29 03:26:45,626 INFO L280 TraceCheckUtils]: 7: Hoare triple {1571#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1571#unseeded} is VALID [2020-07-29 03:26:45,627 INFO L280 TraceCheckUtils]: 8: Hoare triple {1571#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1571#unseeded} is VALID [2020-07-29 03:26:45,627 INFO L280 TraceCheckUtils]: 9: Hoare triple {1571#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1571#unseeded} is VALID [2020-07-29 03:26:45,627 INFO L280 TraceCheckUtils]: 10: Hoare triple {1571#unseeded} assume !(main_~i~1 < main_~array_size~0); {1571#unseeded} is VALID [2020-07-29 03:26:45,628 INFO L280 TraceCheckUtils]: 11: Hoare triple {1571#unseeded} 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; {1571#unseeded} is VALID [2020-07-29 03:26:45,628 INFO L280 TraceCheckUtils]: 12: Hoare triple {1571#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; {1571#unseeded} is VALID [2020-07-29 03:26:45,629 INFO L280 TraceCheckUtils]: 13: Hoare triple {1571#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); {1571#unseeded} is VALID [2020-07-29 03:26:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:45,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:45,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:45,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {1574#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; {1574#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size))} is VALID [2020-07-29 03:26:45,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {1574#(>= 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; {1646#(<= (+ ULTIMATE.start_SelectionSort_~array_size 1) (+ ULTIMATE.start_SelectionSort_~j~0 oldRank0))} is VALID [2020-07-29 03:26:45,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {1646#(<= (+ 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); {1599#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_SelectionSort_~j~0) ULTIMATE.start_SelectionSort_~array_size)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:45,679 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 03:26:45,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:45,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:45,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:45,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,690 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 03:26:45,690 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 21 Second operand 4 states. [2020-07-29 03:26:45,764 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 60 states and 77 transitions. Complement of second has 7 states. [2020-07-29 03:26:45,764 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 03:26:45,765 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:45,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 55 transitions. cyclomatic complexity: 21 [2020-07-29 03:26:45,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:45,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:45,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:45,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:45,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:45,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:45,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 77 transitions. [2020-07-29 03:26:45,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:45,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:45,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:45,768 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 55 transitions. cyclomatic complexity: 21 [2020-07-29 03:26:45,769 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:26:45,770 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:45,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:45,771 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:45,771 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 77 transitions. cyclomatic complexity: 24 [2020-07-29 03:26:45,772 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:45,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:45,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:45,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:45,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:45,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:45,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:45,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:45,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:45,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:45,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 60 letters. Loop has 60 letters. [2020-07-29 03:26:45,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 03:26:45,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 60 letters. Loop has 60 letters. [2020-07-29 03:26:45,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:26:45,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:26:45,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:26:45,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:45,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:45,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:45,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:45,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:45,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:45,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:45,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:45,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:45,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:45,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:45,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:45,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:45,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:45,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:45,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:45,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:45,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:45,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:45,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:45,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:45,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:45,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:45,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:26:45,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:45,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:45,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:45,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:45,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:45,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:45,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 55 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:45,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:45,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 77 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:45,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,792 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-29 03:26:45,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:45,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:45,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:26:45,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:45,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 77 transitions. cyclomatic complexity: 24 [2020-07-29 03:26:45,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:45,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 39 states and 50 transitions. [2020-07-29 03:26:45,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:26:45,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:26:45,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2020-07-29 03:26:45,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:45,799 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2020-07-29 03:26:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2020-07-29 03:26:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2020-07-29 03:26:45,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:45,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 50 transitions. Second operand 33 states. [2020-07-29 03:26:45,801 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 50 transitions. Second operand 33 states. [2020-07-29 03:26:45,802 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 33 states. [2020-07-29 03:26:45,802 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:45,804 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-29 03:26:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-07-29 03:26:45,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:45,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:45,805 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 39 states and 50 transitions. [2020-07-29 03:26:45,805 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 39 states and 50 transitions. [2020-07-29 03:26:45,806 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:45,808 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-29 03:26:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-07-29 03:26:45,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:45,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:45,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:45,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:26:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2020-07-29 03:26:45,811 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-07-29 03:26:45,811 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-07-29 03:26:45,811 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:26:45,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2020-07-29 03:26:45,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:45,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:45,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:45,813 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:45,813 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:45,813 INFO L794 eck$LassoCheckResult]: Stem: 1742#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1735#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1736#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1743#L531-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;main_~i~1 := 0; 1732#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1733#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1734#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1727#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1728#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1746#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1745#L536-3 assume !(main_~i~1 < main_~array_size~0); 1737#L536-4 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; 1729#L515-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; 1730#L519-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); 1723#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 1741#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1747#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1724#L519-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); 1725#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1726#L515-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; 1720#L519-3 [2020-07-29 03:26:45,813 INFO L796 eck$LassoCheckResult]: Loop: 1720#L519-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); 1721#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 1738#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1720#L519-3 [2020-07-29 03:26:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:45,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1462098487, now seen corresponding path program 3 times [2020-07-29 03:26:45,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:45,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228921354] [2020-07-29 03:26:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:45,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {1923#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1923#true} is VALID [2020-07-29 03:26:45,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {1923#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1923#true} is VALID [2020-07-29 03:26:45,948 INFO L280 TraceCheckUtils]: 2: Hoare triple {1923#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1923#true} is VALID [2020-07-29 03:26:45,950 INFO L280 TraceCheckUtils]: 3: Hoare triple {1923#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;main_~i~1 := 0; {1925#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:45,951 INFO L280 TraceCheckUtils]: 4: Hoare triple {1925#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1925#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:45,952 INFO L280 TraceCheckUtils]: 5: Hoare triple {1925#(and (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1926#(and (<= 1 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:45,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {1926#(and (<= 1 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1926#(and (<= 1 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:45,954 INFO L280 TraceCheckUtils]: 7: Hoare triple {1926#(and (<= 1 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~numbers~0.offset) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1927#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (<= 2 ULTIMATE.start_main_~i~1) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:26:45,955 INFO L280 TraceCheckUtils]: 8: Hoare triple {1927#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (<= 2 ULTIMATE.start_main_~i~1) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1928#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:45,956 INFO L280 TraceCheckUtils]: 9: Hoare triple {1928#(<= 3 ULTIMATE.start_main_~array_size~0)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1928#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:45,957 INFO L280 TraceCheckUtils]: 10: Hoare triple {1928#(<= 3 ULTIMATE.start_main_~array_size~0)} assume !(main_~i~1 < main_~array_size~0); {1928#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:45,958 INFO L280 TraceCheckUtils]: 11: Hoare triple {1928#(<= 3 ULTIMATE.start_main_~array_size~0)} 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; {1929#(and (= 0 ULTIMATE.start_SelectionSort_~i~0) (<= 3 ULTIMATE.start_SelectionSort_~array_size))} is VALID [2020-07-29 03:26:45,959 INFO L280 TraceCheckUtils]: 12: Hoare triple {1929#(and (= 0 ULTIMATE.start_SelectionSort_~i~0) (<= 3 ULTIMATE.start_SelectionSort_~array_size))} 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; {1930#(<= (+ ULTIMATE.start_SelectionSort_~j~0 2) ULTIMATE.start_SelectionSort_~array_size)} is VALID [2020-07-29 03:26:45,960 INFO L280 TraceCheckUtils]: 13: Hoare triple {1930#(<= (+ ULTIMATE.start_SelectionSort_~j~0 2) ULTIMATE.start_SelectionSort_~array_size)} 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); {1930#(<= (+ ULTIMATE.start_SelectionSort_~j~0 2) ULTIMATE.start_SelectionSort_~array_size)} is VALID [2020-07-29 03:26:45,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {1930#(<= (+ ULTIMATE.start_SelectionSort_~j~0 2) ULTIMATE.start_SelectionSort_~array_size)} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; {1930#(<= (+ ULTIMATE.start_SelectionSort_~j~0 2) ULTIMATE.start_SelectionSort_~array_size)} is VALID [2020-07-29 03:26:45,961 INFO L280 TraceCheckUtils]: 15: Hoare triple {1930#(<= (+ ULTIMATE.start_SelectionSort_~j~0 2) ULTIMATE.start_SelectionSort_~array_size)} SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; {1931#(<= (+ ULTIMATE.start_SelectionSort_~j~0 1) ULTIMATE.start_SelectionSort_~array_size)} is VALID [2020-07-29 03:26:45,962 INFO L280 TraceCheckUtils]: 16: Hoare triple {1931#(<= (+ ULTIMATE.start_SelectionSort_~j~0 1) ULTIMATE.start_SelectionSort_~array_size)} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {1924#false} is VALID [2020-07-29 03:26:45,963 INFO L280 TraceCheckUtils]: 17: Hoare triple {1924#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); {1924#false} is VALID [2020-07-29 03:26:45,963 INFO L280 TraceCheckUtils]: 18: Hoare triple {1924#false} SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; {1924#false} is VALID [2020-07-29 03:26:45,963 INFO L280 TraceCheckUtils]: 19: Hoare triple {1924#false} 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; {1924#false} is VALID [2020-07-29 03:26:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:45,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228921354] [2020-07-29 03:26:45,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722370599] [2020-07-29 03:26:45,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:46,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 03:26:46,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:26:46,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:26:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:46,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:46,164 INFO L280 TraceCheckUtils]: 0: Hoare triple {1923#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1923#true} is VALID [2020-07-29 03:26:46,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {1923#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1923#true} is VALID [2020-07-29 03:26:46,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {1923#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1923#true} is VALID [2020-07-29 03:26:46,165 INFO L280 TraceCheckUtils]: 3: Hoare triple {1923#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;main_~i~1 := 0; {1923#true} is VALID [2020-07-29 03:26:46,165 INFO L280 TraceCheckUtils]: 4: Hoare triple {1923#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1923#true} is VALID [2020-07-29 03:26:46,165 INFO L280 TraceCheckUtils]: 5: Hoare triple {1923#true} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1923#true} is VALID [2020-07-29 03:26:46,166 INFO L280 TraceCheckUtils]: 6: Hoare triple {1923#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1923#true} is VALID [2020-07-29 03:26:46,166 INFO L280 TraceCheckUtils]: 7: Hoare triple {1923#true} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1923#true} is VALID [2020-07-29 03:26:46,166 INFO L280 TraceCheckUtils]: 8: Hoare triple {1923#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1923#true} is VALID [2020-07-29 03:26:46,166 INFO L280 TraceCheckUtils]: 9: Hoare triple {1923#true} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1923#true} is VALID [2020-07-29 03:26:46,166 INFO L280 TraceCheckUtils]: 10: Hoare triple {1923#true} assume !(main_~i~1 < main_~array_size~0); {1923#true} is VALID [2020-07-29 03:26:46,167 INFO L280 TraceCheckUtils]: 11: Hoare triple {1923#true} 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; {1923#true} is VALID [2020-07-29 03:26:46,168 INFO L280 TraceCheckUtils]: 12: Hoare triple {1923#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; {1971#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 03:26:46,168 INFO L280 TraceCheckUtils]: 13: Hoare triple {1971#(<= 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); {1971#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 03:26:46,169 INFO L280 TraceCheckUtils]: 14: Hoare triple {1971#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; {1971#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 03:26:46,170 INFO L280 TraceCheckUtils]: 15: Hoare triple {1971#(<= 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; {1981#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 2))} is VALID [2020-07-29 03:26:46,171 INFO L280 TraceCheckUtils]: 16: Hoare triple {1981#(<= ULTIMATE.start_SelectionSort_~j~0 (+ ULTIMATE.start_SelectionSort_~i~0 2))} assume !(SelectionSort_~j~0 < SelectionSort_~array_size); {1985#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 2))} is VALID [2020-07-29 03:26:46,171 INFO L280 TraceCheckUtils]: 17: Hoare triple {1985#(<= 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); {1985#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 2))} is VALID [2020-07-29 03:26:46,172 INFO L280 TraceCheckUtils]: 18: Hoare triple {1985#(<= 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; {1992#(<= ULTIMATE.start_SelectionSort_~array_size (+ ULTIMATE.start_SelectionSort_~i~0 1))} is VALID [2020-07-29 03:26:46,173 INFO L280 TraceCheckUtils]: 19: Hoare triple {1992#(<= 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; {1924#false} is VALID [2020-07-29 03:26:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-29 03:26:46,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:46,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2020-07-29 03:26:46,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386670218] [2020-07-29 03:26:46,175 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:46,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:46,175 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-07-29 03:26:46,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:46,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436904016] [2020-07-29 03:26:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:46,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:46,196 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:46,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:46,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:46,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 03:26:46,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-07-29 03:26:46,266 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. cyclomatic complexity: 14 Second operand 13 states. [2020-07-29 03:26:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:47,349 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2020-07-29 03:26:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-29 03:26:47,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:26:47,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:47,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 86 transitions. [2020-07-29 03:26:47,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:47,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 61 states and 80 transitions. [2020-07-29 03:26:47,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 03:26:47,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 03:26:47,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 80 transitions. [2020-07-29 03:26:47,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:47,427 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2020-07-29 03:26:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 80 transitions. [2020-07-29 03:26:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2020-07-29 03:26:47,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:47,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 80 transitions. Second operand 39 states. [2020-07-29 03:26:47,431 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 80 transitions. Second operand 39 states. [2020-07-29 03:26:47,431 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 39 states. [2020-07-29 03:26:47,431 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:47,434 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2020-07-29 03:26:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2020-07-29 03:26:47,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:47,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:47,435 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 61 states and 80 transitions. [2020-07-29 03:26:47,435 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 61 states and 80 transitions. [2020-07-29 03:26:47,435 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:47,453 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2020-07-29 03:26:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2020-07-29 03:26:47,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:47,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:47,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:47,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 03:26:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2020-07-29 03:26:47,458 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2020-07-29 03:26:47,458 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2020-07-29 03:26:47,458 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:26:47,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2020-07-29 03:26:47,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:47,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,463 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:47,463 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:47,463 INFO L794 eck$LassoCheckResult]: Stem: 2105#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2099#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 2100#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2106#L531-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;main_~i~1 := 0; 2097#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2092#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2093#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2098#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2111#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2110#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2109#L536-3 assume !(main_~i~1 < main_~array_size~0); 2101#L536-4 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; 2094#L515-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; 2095#L519-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); 2103#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 2104#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2087#L519-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); 2088#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 2117#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2112#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2089#L519-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); 2090#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2091#L515-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; 2085#L519-3 [2020-07-29 03:26:47,463 INFO L796 eck$LassoCheckResult]: Loop: 2085#L519-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); 2086#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 2102#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2085#L519-3 [2020-07-29 03:26:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,464 INFO L82 PathProgramCache]: Analyzing trace with hash 95688324, now seen corresponding path program 1 times [2020-07-29 03:26:47,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:47,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545998268] [2020-07-29 03:26:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,517 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:47,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-07-29 03:26:47,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:47,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759982983] [2020-07-29 03:26:47,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:47,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1207385433, now seen corresponding path program 1 times [2020-07-29 03:26:47,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:47,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162432087] [2020-07-29 03:26:47,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:47,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:47,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:48,613 WARN L193 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 143 [2020-07-29 03:26:48,948 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-07-29 03:26:48,951 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:48,951 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:48,951 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:48,952 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:48,952 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:48,952 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:48,952 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:48,952 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:48,952 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration10_Lasso [2020-07-29 03:26:48,952 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:48,953 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:48,990 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 03:26:48,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,997 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 03:26:49,001 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 03:26:49,005 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 03:26:49,008 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 03:26:49,080 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 03:26:49,086 INFO L168 Benchmark]: Toolchain (without parser) took 17518.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 411.0 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -231.1 MB). Peak memory consumption was 179.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:49,086 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 03:26:49,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 694.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:49,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.92 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 03:26:49,087 INFO L168 Benchmark]: Boogie Preprocessor took 30.24 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 03:26:49,088 INFO L168 Benchmark]: RCFGBuilder took 542.59 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: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:49,088 INFO L168 Benchmark]: BuchiAutomizer took 16192.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 266.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.4 MB). Peak memory consumption was 173.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:49,091 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 694.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.24 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 542.59 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: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16192.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 266.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.4 MB). Peak memory consumption was 173.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...