./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../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-f470102 [2019-11-28 21:26:07,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:26:07,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:26:07,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:26:07,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:26:07,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:26:07,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:26:07,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:26:07,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:26:07,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:26:07,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:26:07,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:26:07,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:26:07,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:26:07,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:26:07,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:26:07,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:26:07,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:26:07,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:26:07,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:26:07,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:26:07,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:26:07,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:26:07,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:26:07,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:26:07,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:26:07,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:26:07,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:26:07,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:26:07,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:26:07,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:26:07,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:26:07,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:26:07,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:26:07,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:26:07,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:26:07,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:26:07,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:26:07,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:26:07,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:26:07,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:26:07,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:26:07,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:26:07,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:26:07,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:26:07,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:26:07,300 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:26:07,300 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:26:07,301 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:26:07,301 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:26:07,301 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:26:07,302 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:26:07,302 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:26:07,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:26:07,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:26:07,303 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:26:07,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:26:07,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:26:07,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:26:07,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:26:07,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:26:07,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:26:07,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:26:07,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:26:07,305 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:26:07,306 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:26:07,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:26:07,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:26:07,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:26:07,307 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:26:07,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:26:07,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:26:07,308 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:26:07,308 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:26:07,309 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:26:07,310 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 [2019-11-28 21:26:07,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:26:07,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:26:07,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:26:07,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:26:07,639 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:26:07,640 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-11-28 21:26:07,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4395be8ab/98b073acf83044eea1ab21c43bc4b509/FLAG35904a000 [2019-11-28 21:26:08,273 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:26:08,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-11-28 21:26:08,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4395be8ab/98b073acf83044eea1ab21c43bc4b509/FLAG35904a000 [2019-11-28 21:26:08,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4395be8ab/98b073acf83044eea1ab21c43bc4b509 [2019-11-28 21:26:08,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:26:08,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:26:08,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:08,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:26:08,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:26:08,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:08" (1/1) ... [2019-11-28 21:26:08,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cebebe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:08, skipping insertion in model container [2019-11-28 21:26:08,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:08" (1/1) ... [2019-11-28 21:26:08,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:26:08,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:26:09,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:09,099 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:26:09,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:09,196 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:26:09,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09 WrapperNode [2019-11-28 21:26:09,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:09,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:09,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:26:09,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:26:09,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (1/1) ... [2019-11-28 21:26:09,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (1/1) ... [2019-11-28 21:26:09,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:09,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:26:09,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:26:09,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:26:09,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (1/1) ... [2019-11-28 21:26:09,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (1/1) ... [2019-11-28 21:26:09,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (1/1) ... [2019-11-28 21:26:09,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (1/1) ... [2019-11-28 21:26:09,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (1/1) ... [2019-11-28 21:26:09,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (1/1) ... [2019-11-28 21:26:09,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (1/1) ... [2019-11-28 21:26:09,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:26:09,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:26:09,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:26:09,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:26:09,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 21:26:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 21:26:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:26:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:26:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:26:09,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:26:09,664 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:26:09,664 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 21:26:09,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:09 BoogieIcfgContainer [2019-11-28 21:26:09,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:26:09,666 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:26:09,667 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:26:09,676 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:26:09,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:09,678 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:26:08" (1/3) ... [2019-11-28 21:26:09,679 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52b4f0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:09, skipping insertion in model container [2019-11-28 21:26:09,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:09,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:09" (2/3) ... [2019-11-28 21:26:09,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52b4f0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:09, skipping insertion in model container [2019-11-28 21:26:09,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:09,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:09" (3/3) ... [2019-11-28 21:26:09,682 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2019-11-28 21:26:09,734 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:26:09,734 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:26:09,734 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:26:09,734 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:26:09,735 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:26:09,735 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:26:09,735 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:26:09,735 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:26:09,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-28 21:26:09,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 21:26:09,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:09,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:09,775 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 21:26:09,775 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:09,775 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:26:09,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-28 21:26:09,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 21:26:09,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:09,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:09,778 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 21:26:09,778 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:09,786 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 [2019-11-28 21:26:09,786 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 [2019-11-28 21:26:09,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:09,793 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-28 21:26:09,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:09,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122384478] [2019-11-28 21:26:09,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:09,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-28 21:26:09,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:09,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113485794] [2019-11-28 21:26:09,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:09,961 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:09,967 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-28 21:26:09,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:09,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39695887] [2019-11-28 21:26:09,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:10,014 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:10,208 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-28 21:26:10,268 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:10,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:10,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:10,269 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:10,269 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:10,269 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:10,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:10,270 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2019-11-28 21:26:10,270 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:10,270 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:10,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:10,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:10,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:10,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:10,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:10,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:10,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:10,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:10,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:10,769 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:10,775 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) [2019-11-28 21:26:10,783 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 [2019-11-28 21:26:10,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,790 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 [2019-11-28 21:26:10,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,820 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 [2019-11-28 21:26:10,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:10,832 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) [2019-11-28 21:26:10,849 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 [2019-11-28 21:26:10,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:10,864 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 [2019-11-28 21:26:10,870 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,888 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 [2019-11-28 21:26:10,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:10,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:10,900 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) [2019-11-28 21:26:10,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:10,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:10,944 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 [2019-11-28 21:26:10,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,951 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 [2019-11-28 21:26:10,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:10,973 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 [2019-11-28 21:26:10,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:10,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:10,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:10,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:10,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:10,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:10,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:10,983 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) [2019-11-28 21:26:11,003 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 [2019-11-28 21:26:11,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:11,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:11,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:11,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:11,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:11,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:11,046 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:11,113 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 21:26:11,113 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 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) [2019-11-28 21:26:11,122 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 [2019-11-28 21:26:11,126 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 21:26:11,126 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:11,127 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) = 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-11-28 21:26:11,149 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 21:26:11,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:26:11,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:11,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:26:11,242 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:11,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 21:26:11,265 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:11,306 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:26:11,308 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-11-28 21:26:11,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 41 states and 59 transitions. Complement of second has 7 states. [2019-11-28 21:26:11,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:26:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2019-11-28 21:26:11,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 21:26:11,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:11,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-28 21:26:11,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:11,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-28 21:26:11,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:11,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2019-11-28 21:26:11,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 21:26:11,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 14 states and 19 transitions. [2019-11-28 21:26:11,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 21:26:11,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 21:26:11,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-28 21:26:11,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:11,470 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 21:26:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-28 21:26:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 21:26:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 21:26:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-28 21:26:11,502 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 21:26:11,502 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 21:26:11,502 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:26:11,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-28 21:26:11,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 21:26:11,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:11,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:11,505 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:26:11,505 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:26:11,506 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 133#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; 134#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 137#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; 131#L536-3 assume !(main_~i~1 < main_~array_size~0); 132#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; 128#L515-3 [2019-11-28 21:26:11,506 INFO L796 eck$LassoCheckResult]: Loop: 128#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; 124#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 125#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); 127#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 128#L515-3 [2019-11-28 21:26:11,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:11,506 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-28 21:26:11,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:11,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198618845] [2019-11-28 21:26:11,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:11,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198618845] [2019-11-28 21:26:11,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:11,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:26:11,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079174878] [2019-11-28 21:26:11,640 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:26:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2019-11-28 21:26:11,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:11,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968847308] [2019-11-28 21:26:11,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:11,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968847308] [2019-11-28 21:26:11,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:11,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 21:26:11,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687768022] [2019-11-28 21:26:11,678 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:26:11,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:11,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:26:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:26:11,686 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 21:26:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:11,708 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2019-11-28 21:26:11,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:26:11,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2019-11-28 21:26:11,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:11,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2019-11-28 21:26:11,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:26:11,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 21:26:11,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-28 21:26:11,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:11,712 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 21:26:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-28 21:26:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 21:26:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 21:26:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-28 21:26:11,719 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 21:26:11,719 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 21:26:11,719 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:26:11,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-28 21:26:11,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:11,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:11,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:11,730 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:26:11,732 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:11,732 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 170#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; 171#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 174#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; 168#L536-3 assume !(main_~i~1 < main_~array_size~0); 169#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; 165#L515-3 [2019-11-28 21:26:11,733 INFO L796 eck$LassoCheckResult]: Loop: 165#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; 161#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); 162#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 172#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 175#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 163#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); 164#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 165#L515-3 [2019-11-28 21:26:11,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:11,733 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-11-28 21:26:11,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:11,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235700406] [2019-11-28 21:26:11,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:11,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235700406] [2019-11-28 21:26:11,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:11,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:26:11,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241434545] [2019-11-28 21:26:11,787 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:26:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2019-11-28 21:26:11,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:11,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442837828] [2019-11-28 21:26:11,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:11,837 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:11,985 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-28 21:26:12,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:12,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:26:12,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:26:12,029 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 21:26:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:12,053 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-11-28 21:26:12,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:26:12,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-28 21:26:12,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:12,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-11-28 21:26:12,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:26:12,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 21:26:12,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-11-28 21:26:12,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:12,056 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-28 21:26:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-11-28 21:26:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-28 21:26:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 21:26:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 21:26:12,058 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 21:26:12,058 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 21:26:12,058 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:26:12,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-28 21:26:12,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:12,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:12,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:12,059 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:12,060 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:12,060 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 208#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; 209#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 212#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; 206#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; 204#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 205#L536-3 assume !(main_~i~1 < main_~array_size~0); 207#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; 203#L515-3 [2019-11-28 21:26:12,060 INFO L796 eck$LassoCheckResult]: Loop: 203#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; 199#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); 200#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 210#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 213#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 201#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); 202#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 203#L515-3 [2019-11-28 21:26:12,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:12,060 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-28 21:26:12,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:12,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46595528] [2019-11-28 21:26:12,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,107 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:12,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:12,110 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2019-11-28 21:26:12,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:12,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449365227] [2019-11-28 21:26:12,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:12,158 INFO L82 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2019-11-28 21:26:12,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:12,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547305473] [2019-11-28 21:26:12,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:26:12,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547305473] [2019-11-28 21:26:12,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275828666] [2019-11-28 21:26:12,307 INFO L94 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 [2019-11-28 21:26:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:12,378 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:26:12,380 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:26:12,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:26:12,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-28 21:26:12,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394849589] [2019-11-28 21:26:12,591 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-28 21:26:12,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:12,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 21:26:12,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 21:26:12,673 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-11-28 21:26:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:12,798 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-28 21:26:12,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 21:26:12,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-28 21:26:12,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:12,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-11-28 21:26:12,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:26:12,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 21:26:12,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-28 21:26:12,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:12,802 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 21:26:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-28 21:26:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 21:26:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:26:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 21:26:12,805 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 21:26:12,805 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 21:26:12,805 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:26:12,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-28 21:26:12,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:12,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:12,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:12,806 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:12,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:12,807 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 312#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; 313#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 316#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; 309#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; 307#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 308#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; 310#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 318#L536-3 assume !(main_~i~1 < main_~array_size~0); 311#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; 306#L515-3 [2019-11-28 21:26:12,807 INFO L796 eck$LassoCheckResult]: Loop: 306#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; 302#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); 303#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 314#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 317#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 304#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); 305#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 306#L515-3 [2019-11-28 21:26:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:12,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-11-28 21:26:12,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:12,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304303852] [2019-11-28 21:26:12,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,831 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:12,831 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2019-11-28 21:26:12,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:12,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001035791] [2019-11-28 21:26:12,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2019-11-28 21:26:12,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:12,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985432947] [2019-11-28 21:26:12,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:12,892 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:13,009 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-28 21:26:13,280 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-11-28 21:26:13,356 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:13,356 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:13,356 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:13,356 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:13,357 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:13,357 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:13,357 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:13,357 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:13,357 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2019-11-28 21:26:13,357 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:13,357 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:13,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:13,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:14,067 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:14,067 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 [2019-11-28 21:26:14,080 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 [2019-11-28 21:26:14,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:14,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:14,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:14,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:14,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:14,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:14,100 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 [2019-11-28 21:26:14,115 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 [2019-11-28 21:26:14,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:14,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:14,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:14,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:14,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:14,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:14,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:14,124 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 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:14,133 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 [2019-11-28 21:26:14,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:14,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:14,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:14,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:14,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:14,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:14,147 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 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 [2019-11-28 21:26:14,160 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 [2019-11-28 21:26:14,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:14,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:14,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:14,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:14,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:14,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:14,168 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) [2019-11-28 21:26:14,179 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 [2019-11-28 21:26:14,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:14,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:14,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:14,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:14,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:14,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:14,213 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:14,397 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2019-11-28 21:26:14,398 INFO L444 ModelExtractionUtils]: 25 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:14,410 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:14,413 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 21:26:14,413 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:14,413 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0) = -2*ULTIMATE.start_SelectionSort_~i~0 + 1 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~array_size + 2 >= 0] [2019-11-28 21:26:14,434 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-28 21:26:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:14,480 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:26:14,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:14,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 21:26:14,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:26:14,559 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-11-28 21:26:14,559 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-28 21:26:14,692 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 37 states and 46 transitions. Complement of second has 10 states. [2019-11-28 21:26:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-28 21:26:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 21:26:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2019-11-28 21:26:14,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-28 21:26:14,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:14,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 17 letters. Loop has 7 letters. [2019-11-28 21:26:14,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:14,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 14 letters. [2019-11-28 21:26:14,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:14,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2019-11-28 21:26:14,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 21:26:14,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 44 transitions. [2019-11-28 21:26:14,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 21:26:14,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 21:26:14,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-11-28 21:26:14,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:14,698 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-28 21:26:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-11-28 21:26:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-28 21:26:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 21:26:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-11-28 21:26:14,702 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-28 21:26:14,702 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-28 21:26:14,702 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:26:14,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2019-11-28 21:26:14,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 21:26:14,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:14,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:14,704 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:14,704 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:26:14,704 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 486#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; 487#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 492#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; 484#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; 481#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 482#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; 485#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 501#L536-3 assume !(main_~i~1 < main_~array_size~0); 498#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; 497#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; 471#L519-3 [2019-11-28 21:26:14,704 INFO L796 eck$LassoCheckResult]: Loop: 471#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); 472#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 489#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 471#L519-3 [2019-11-28 21:26:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-11-28 21:26:14,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:14,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006477321] [2019-11-28 21:26:14,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:14,727 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:14,727 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-11-28 21:26:14,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:14,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436238735] [2019-11-28 21:26:14,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:14,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-11-28 21:26:14,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:14,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53083652] [2019-11-28 21:26:14,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:14,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:15,088 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-11-28 21:26:15,182 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:15,183 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:15,183 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:15,183 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:15,183 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:15,183 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:15,183 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:15,184 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:15,184 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2019-11-28 21:26:15,184 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:15,184 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:15,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,365 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-28 21:26:15,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:15,732 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-28 21:26:15,991 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:15,994 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 21:26:16,009 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 [2019-11-28 21:26:16,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:16,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:16,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,033 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 [2019-11-28 21:26:16,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:16,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:16,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:16,038 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) [2019-11-28 21:26:16,052 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 [2019-11-28 21:26:16,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:16,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,062 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) [2019-11-28 21:26:16,090 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 [2019-11-28 21:26:16,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:16,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:16,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,096 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) [2019-11-28 21:26:16,114 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 [2019-11-28 21:26:16,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:16,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:16,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,123 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) [2019-11-28 21:26:16,133 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 [2019-11-28 21:26:16,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:16,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,156 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) [2019-11-28 21:26:16,168 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 [2019-11-28 21:26:16,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:16,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:16,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:16,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:16,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:16,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,214 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:16,285 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 21:26:16,285 INFO L444 ModelExtractionUtils]: 23 out of 46 variables were initially zero. Simplification set additionally 14 variables to zero. 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) [2019-11-28 21:26:16,291 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:16,295 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2019-11-28 21:26:16,296 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:16,296 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~min~0) = -4*ULTIMATE.start_SelectionSort_~min~0 + 5 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a.offset - 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 + 8 >= 0, 1*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~min~0 - 1 >= 0] [2019-11-28 21:26:16,330 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2019-11-28 21:26:16,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:16,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 21:26:16,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:16,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 21:26:16,418 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:16,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:16,426 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:26:16,426 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-28 21:26:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:16,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:26:16,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:16,606 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2019-11-28 21:26:16,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-11-28 21:26:16,938 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13. Second operand 9 states. Result 59 states and 75 transitions. Complement of second has 13 states. [2019-11-28 21:26:16,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 21:26:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 21:26:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-11-28 21:26:16,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-28 21:26:16,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:16,940 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 21:26:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:16,982 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 21:26:16,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:16,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 21:26:16,990 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:26:16,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:26:16,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:26:16,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-28 21:26:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:17,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:26:17,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:17,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 3 loop predicates [2019-11-28 21:26:17,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-11-28 21:26:17,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13. Second operand 9 states. Result 62 states and 83 transitions. Complement of second has 15 states. [2019-11-28 21:26:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 6 stem states 3 non-accepting loop states 2 accepting loop states [2019-11-28 21:26:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 21:26:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2019-11-28 21:26:17,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-28 21:26:17,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:17,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 21:26:17,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:17,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-28 21:26:17,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:17,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 83 transitions. [2019-11-28 21:26:17,481 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-28 21:26:17,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 76 transitions. [2019-11-28 21:26:17,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 21:26:17,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 21:26:17,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 76 transitions. [2019-11-28 21:26:17,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:17,485 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 76 transitions. [2019-11-28 21:26:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 76 transitions. [2019-11-28 21:26:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-11-28 21:26:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 21:26:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2019-11-28 21:26:17,490 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-11-28 21:26:17,490 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-11-28 21:26:17,490 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:26:17,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2019-11-28 21:26:17,491 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-28 21:26:17,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:17,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:17,492 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:17,492 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:17,492 INFO L794 eck$LassoCheckResult]: Stem: 852#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 846#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; 847#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 853#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; 844#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; 840#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 841#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; 845#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 860#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; 861#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 866#L536-3 assume !(main_~i~1 < main_~array_size~0); 848#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; 838#L515-3 [2019-11-28 21:26:17,492 INFO L796 eck$LassoCheckResult]: Loop: 838#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; 842#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); 856#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 857#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 855#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 834#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); 835#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 838#L515-3 [2019-11-28 21:26:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash -304680909, now seen corresponding path program 3 times [2019-11-28 21:26:17,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:17,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635487271] [2019-11-28 21:26:17,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,513 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:17,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:17,514 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 4 times [2019-11-28 21:26:17,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:17,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505090562] [2019-11-28 21:26:17,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:17,527 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1848279784, now seen corresponding path program 3 times [2019-11-28 21:26:17,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:17,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27046234] [2019-11-28 21:26:17,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:17,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27046234] [2019-11-28 21:26:17,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480113897] [2019-11-28 21:26:17,623 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:26:17,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 21:26:17,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:26:17,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:26:17,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:17,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:26:17,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-28 21:26:17,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629596885] [2019-11-28 21:26:17,882 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-28 21:26:17,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:17,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 21:26:17,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-28 21:26:17,917 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. cyclomatic complexity: 25 Second operand 17 states. [2019-11-28 21:26:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:18,266 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2019-11-28 21:26:18,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 21:26:18,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 82 transitions. [2019-11-28 21:26:18,268 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-28 21:26:18,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 82 transitions. [2019-11-28 21:26:18,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-28 21:26:18,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-28 21:26:18,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2019-11-28 21:26:18,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:18,270 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-11-28 21:26:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2019-11-28 21:26:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-11-28 21:26:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 21:26:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-11-28 21:26:18,276 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-28 21:26:18,276 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-28 21:26:18,276 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 21:26:18,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-11-28 21:26:18,278 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-28 21:26:18,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:18,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:18,279 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:18,279 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:26:18,279 INFO L794 eck$LassoCheckResult]: Stem: 1048#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1041#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; 1042#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1049#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; 1039#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; 1036#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1037#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; 1040#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1055#L536-3 assume !(main_~i~1 < main_~array_size~0); 1057#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; 1069#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; 1065#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); 1066#L521 [2019-11-28 21:26:18,279 INFO L796 eck$LassoCheckResult]: Loop: 1066#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1074#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1075#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); 1066#L521 [2019-11-28 21:26:18,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:18,280 INFO L82 PathProgramCache]: Analyzing trace with hash -304736135, now seen corresponding path program 1 times [2019-11-28 21:26:18,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:18,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306426085] [2019-11-28 21:26:18,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash 73540, now seen corresponding path program 1 times [2019-11-28 21:26:18,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:18,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557768841] [2019-11-28 21:26:18,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:18,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1166709708, now seen corresponding path program 1 times [2019-11-28 21:26:18,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:18,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207468321] [2019-11-28 21:26:18,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:18,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207468321] [2019-11-28 21:26:18,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419779291] [2019-11-28 21:26:18,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:26:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:18,457 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:26:18,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:18,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:26:18,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-28 21:26:18,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79624805] [2019-11-28 21:26:18,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:18,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 21:26:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-28 21:26:18,600 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 26 Second operand 13 states. [2019-11-28 21:26:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:18,798 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-28 21:26:18,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 21:26:18,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. [2019-11-28 21:26:18,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:18,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 24 states and 28 transitions. [2019-11-28 21:26:18,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 21:26:18,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 21:26:18,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-11-28 21:26:18,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:18,802 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-28 21:26:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-11-28 21:26:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-28 21:26:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 21:26:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-28 21:26:18,805 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-28 21:26:18,805 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-28 21:26:18,805 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 21:26:18,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-11-28 21:26:18,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:18,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:18,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:18,807 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:18,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:18,808 INFO L794 eck$LassoCheckResult]: Stem: 1219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1216#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; 1217#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1220#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; 1212#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; 1213#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1226#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; 1209#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1210#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; 1214#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1224#L536-3 assume !(main_~i~1 < main_~array_size~0); 1215#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; 1211#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; 1204#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); 1205#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1218#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1221#L519-3 [2019-11-28 21:26:18,808 INFO L796 eck$LassoCheckResult]: Loop: 1221#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); 1223#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1225#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1222#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1206#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); 1207#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1208#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; 1221#L519-3 [2019-11-28 21:26:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1270631965, now seen corresponding path program 2 times [2019-11-28 21:26:18,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:18,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368525455] [2019-11-28 21:26:18,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,836 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:18,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1053193502, now seen corresponding path program 5 times [2019-11-28 21:26:18,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:18,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100399835] [2019-11-28 21:26:18,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:18,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:18,849 INFO L82 PathProgramCache]: Analyzing trace with hash 38430022, now seen corresponding path program 1 times [2019-11-28 21:26:18,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:18,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769722341] [2019-11-28 21:26:18,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:18,901 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:19,036 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-28 21:26:19,453 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 114 [2019-11-28 21:26:19,560 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:19,560 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:19,560 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:19,560 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:19,560 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:19,561 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:19,561 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:19,561 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:19,561 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration9_Lasso [2019-11-28 21:26:19,561 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:19,561 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:19,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,812 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-28 21:26:19,971 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-11-28 21:26:19,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:19,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:20,209 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-28 21:26:20,458 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:20,458 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 21:26:20,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 [2019-11-28 21:26:20,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:20,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:20,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:20,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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,478 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 [2019-11-28 21:26:20,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:20,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:20,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,489 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 [2019-11-28 21:26:20,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:20,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:20,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:20,498 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) [2019-11-28 21:26:20,510 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 [2019-11-28 21:26:20,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:20,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:20,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,514 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) [2019-11-28 21:26:20,522 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 [2019-11-28 21:26:20,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:20,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,528 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) [2019-11-28 21:26:20,535 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 [2019-11-28 21:26:20,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:20,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:20,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:20,549 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 [2019-11-28 21:26:20,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:20,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:20,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:20,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:20,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:20,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:20,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:20,592 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 [2019-11-28 21:26:20,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:20,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:20,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:20,604 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 [2019-11-28 21:26:20,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:20,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:20,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:20,618 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 [2019-11-28 21:26:20,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:20,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:20,636 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 [2019-11-28 21:26:20,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:20,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:20,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,655 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 [2019-11-28 21:26:20,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:20,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:20,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,675 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 [2019-11-28 21:26:20,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:20,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:20,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,686 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 [2019-11-28 21:26:20,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:20,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:20,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:20,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:20,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:20,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:20,727 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:20,782 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 21:26:20,782 INFO L444 ModelExtractionUtils]: 21 out of 46 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:20,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:26:20,793 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:26:20,794 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:20,794 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~j~0) = -1*ULTIMATE.start_SelectionSort_~i~0 + 1*ULTIMATE.start_SelectionSort_~j~0 Supporting invariants [] [2019-11-28 21:26:20,822 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 21:26:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:20,849 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:26:20,850 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:20,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 21:26:20,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:20,884 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 21:26:20,884 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 6 states. [2019-11-28 21:26:20,952 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 41 states and 51 transitions. Complement of second has 11 states. [2019-11-28 21:26:20,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 21:26:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-11-28 21:26:20,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 7 letters. [2019-11-28 21:26:20,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:20,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 23 letters. Loop has 7 letters. [2019-11-28 21:26:20,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:20,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 14 letters. [2019-11-28 21:26:20,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:20,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-11-28 21:26:20,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:20,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 36 states and 45 transitions. [2019-11-28 21:26:20,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 21:26:20,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-28 21:26:20,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-11-28 21:26:20,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:20,957 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-28 21:26:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-11-28 21:26:20,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-28 21:26:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 21:26:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-28 21:26:20,960 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-28 21:26:20,960 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-28 21:26:20,960 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 21:26:20,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-11-28 21:26:20,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:26:20,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:20,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:20,962 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:20,962 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:20,962 INFO L794 eck$LassoCheckResult]: Stem: 1428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1422#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; 1423#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1429#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; 1420#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; 1418#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1419#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; 1421#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1435#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; 1434#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1433#L536-3 assume !(main_~i~1 < main_~array_size~0); 1424#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; 1425#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; 1439#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); 1438#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1437#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1436#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); 1411#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1430#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1407#L519-3 [2019-11-28 21:26:20,962 INFO L796 eck$LassoCheckResult]: Loop: 1407#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); 1408#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1426#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1432#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1412#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); 1413#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1416#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; 1407#L519-3 [2019-11-28 21:26:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:20,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1850128556, now seen corresponding path program 3 times [2019-11-28 21:26:20,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:20,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023244250] [2019-11-28 21:26:20,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:20,987 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:20,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:20,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1053193502, now seen corresponding path program 6 times [2019-11-28 21:26:20,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:20,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551095112] [2019-11-28 21:26:20,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:20,997 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:20,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash 333237207, now seen corresponding path program 2 times [2019-11-28 21:26:20,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:20,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589946802] [2019-11-28 21:26:20,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:21,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589946802] [2019-11-28 21:26:21,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633089396] [2019-11-28 21:26:21,110 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:26:21,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 21:26:21,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 21:26:21,157 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 21:26:21,159 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:21,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:26:21,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-28 21:26:21,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701517593] [2019-11-28 21:26:21,408 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-28 21:26:21,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:21,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 21:26:21,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-11-28 21:26:21,452 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. cyclomatic complexity: 11 Second operand 21 states. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Exception during sending of exit command (exit): Stream closed [2019-11-28 21:26:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:21,819 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-11-28 21:26:21,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 21:26:21,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 92 transitions. [2019-11-28 21:26:21,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 21:26:21,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 88 transitions. [2019-11-28 21:26:21,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-28 21:26:21,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-28 21:26:21,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 88 transitions. [2019-11-28 21:26:21,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:21,822 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-11-28 21:26:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 88 transitions. [2019-11-28 21:26:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2019-11-28 21:26:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 21:26:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-11-28 21:26:21,827 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-11-28 21:26:21,828 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-11-28 21:26:21,828 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 21:26:21,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 77 transitions. [2019-11-28 21:26:21,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-28 21:26:21,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:21,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:21,829 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:21,829 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:21,830 INFO L794 eck$LassoCheckResult]: Stem: 1653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1646#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; 1647#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1654#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; 1643#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; 1644#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1672#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; 1638#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1639#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; 1645#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1657#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; 1658#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1660#L536-3 assume !(main_~i~1 < main_~array_size~0); 1648#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; 1649#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; 1668#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); 1669#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1664#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1665#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); 1662#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1673#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1629#L519-3 [2019-11-28 21:26:21,830 INFO L796 eck$LassoCheckResult]: Loop: 1629#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); 1630#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1650#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1674#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1675#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); 1689#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1640#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; 1629#L519-3 [2019-11-28 21:26:21,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:21,830 INFO L82 PathProgramCache]: Analyzing trace with hash -764839030, now seen corresponding path program 4 times [2019-11-28 21:26:21,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:21,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869948903] [2019-11-28 21:26:21,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:21,858 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:21,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1053193502, now seen corresponding path program 7 times [2019-11-28 21:26:21,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:21,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678663005] [2019-11-28 21:26:21,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:21,867 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:21,867 INFO L82 PathProgramCache]: Analyzing trace with hash -557796551, now seen corresponding path program 3 times [2019-11-28 21:26:21,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:21,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900177113] [2019-11-28 21:26:21,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:21,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:22,032 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-28 21:26:22,617 WARN L192 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 137 [2019-11-28 21:26:22,729 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-28 21:26:22,736 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:22,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:22,736 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:22,736 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:22,737 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:22,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:22,737 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:22,737 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:22,737 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration11_Lasso [2019-11-28 21:26:22,737 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:22,737 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:22,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:22,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:22,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:22,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:22,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:22,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:22,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:22,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:22,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:22,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:23,016 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-28 21:26:23,181 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-11-28 21:26:23,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:23,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:23,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:23,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:23,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:23,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:23,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:23,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:23,363 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-11-28 21:26:23,680 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:23,680 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,684 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 [2019-11-28 21:26:23,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:23,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:23,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:23,687 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,692 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 [2019-11-28 21:26:23,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:23,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:23,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:23,697 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,703 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 [2019-11-28 21:26:23,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:23,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:23,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:23,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,713 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 [2019-11-28 21:26:23,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:23,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:23,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:23,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,722 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 [2019-11-28 21:26:23,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:23,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:23,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:23,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:23,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:23,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:23,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,748 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 [2019-11-28 21:26:23,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:23,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:23,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,759 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 [2019-11-28 21:26:23,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:23,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:23,770 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:23,776 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 [2019-11-28 21:26:23,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:23,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:23,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,779 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,785 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 [2019-11-28 21:26:23,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:23,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:23,798 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:23,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:23,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:23,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:23,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:23,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:23,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:23,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:23,914 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2019-11-28 21:26:23,914 INFO L444 ModelExtractionUtils]: 17 out of 43 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:23,919 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:26:23,921 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:26:23,921 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:23,921 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_4, ULTIMATE.start_SelectionSort_~a.offset) = -4*ULTIMATE.start_SelectionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_4 - 1*ULTIMATE.start_SelectionSort_~a.offset Supporting invariants [] [2019-11-28 21:26:23,970 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2019-11-28 21:26:23,972 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:26:23,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:24,014 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:26:24,015 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:24,027 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 21:26:24,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:24,103 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-28 21:26:24,103 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 77 transitions. cyclomatic complexity: 21 Second operand 7 states. [2019-11-28 21:26:24,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 77 transitions. cyclomatic complexity: 21. Second operand 7 states. Result 96 states and 127 transitions. Complement of second has 11 states. [2019-11-28 21:26:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 21:26:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2019-11-28 21:26:24,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2019-11-28 21:26:24,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:24,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 28 letters. Loop has 7 letters. [2019-11-28 21:26:24,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:24,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 14 letters. [2019-11-28 21:26:24,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:24,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 127 transitions. [2019-11-28 21:26:24,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:24,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 43 states and 57 transitions. [2019-11-28 21:26:24,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 21:26:24,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 21:26:24,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2019-11-28 21:26:24,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:24,255 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-11-28 21:26:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2019-11-28 21:26:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-11-28 21:26:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 21:26:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2019-11-28 21:26:24,258 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-11-28 21:26:24,258 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-11-28 21:26:24,258 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 21:26:24,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2019-11-28 21:26:24,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:24,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:24,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:24,259 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:24,259 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:26:24,259 INFO L794 eck$LassoCheckResult]: Stem: 1980#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1976#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; 1977#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1981#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; 1973#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; 1967#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1968#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; 1974#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1987#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; 1986#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1985#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; 1984#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1983#L536-3 assume !(main_~i~1 < main_~array_size~0); 1975#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; 1969#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; 1970#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); 1996#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1995#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1992#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); 1960#L521 [2019-11-28 21:26:24,259 INFO L796 eck$LassoCheckResult]: Loop: 1960#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1978#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1959#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); 1960#L521 [2019-11-28 21:26:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1931519992, now seen corresponding path program 5 times [2019-11-28 21:26:24,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:24,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43039524] [2019-11-28 21:26:24,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:24,286 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:24,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:24,287 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 2 times [2019-11-28 21:26:24,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:24,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923976239] [2019-11-28 21:26:24,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:24,293 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:24,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:24,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2059791963, now seen corresponding path program 1 times [2019-11-28 21:26:24,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:24,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779606912] [2019-11-28 21:26:24,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:24,326 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:25,128 WARN L192 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 132 [2019-11-28 21:26:25,266 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-28 21:26:25,270 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:25,270 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:25,270 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:25,270 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:25,270 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:25,270 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:25,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:25,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:25,270 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration12_Lasso [2019-11-28 21:26:25,270 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:25,271 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:25,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,497 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-11-28 21:26:25,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:25,845 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-11-28 21:26:26,099 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:26,100 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:26,109 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 [2019-11-28 21:26:26,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:26,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:26,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:26,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:26,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:26,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:26,115 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:26,119 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 [2019-11-28 21:26:26,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:26,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:26,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:26,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:26,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:26,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:26,139 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:26,143 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 [2019-11-28 21:26:26,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:26,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:26,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:26,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:26,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:26,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:26,165 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:26,172 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 [2019-11-28 21:26:26,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:26,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:26,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:26,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:26,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:26,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:26,184 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:26,191 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 [2019-11-28 21:26:26,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:26,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:26,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:26,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:26,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:26,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:26,198 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:26,205 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 [2019-11-28 21:26:26,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:26,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:26,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:26,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:26,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:26,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:26,240 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:26,268 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 21:26:26,268 INFO L444 ModelExtractionUtils]: 9 out of 43 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:26,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:26:26,275 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:26:26,275 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:26,275 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 [] [2019-11-28 21:26:26,301 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-11-28 21:26:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:26,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:26:26,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:26,343 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:26:26,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:26,351 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:26:26,351 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-28 21:26:26,387 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 73 states and 95 transitions. Complement of second has 7 states. [2019-11-28 21:26:26,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:26:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-28 21:26:26,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-28 21:26:26,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:26,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 21:26:26,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:26,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 21:26:26,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:26,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 95 transitions. [2019-11-28 21:26:26,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:26,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 56 states and 72 transitions. [2019-11-28 21:26:26,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 21:26:26,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 21:26:26,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2019-11-28 21:26:26,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:26,393 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2019-11-28 21:26:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2019-11-28 21:26:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-11-28 21:26:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 21:26:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-28 21:26:26,397 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-28 21:26:26,397 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-28 21:26:26,397 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 21:26:26,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. [2019-11-28 21:26:26,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:26,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:26,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:26,398 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:26,399 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:26:26,399 INFO L794 eck$LassoCheckResult]: Stem: 2213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2207#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; 2208#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2214#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; 2205#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; 2200#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2201#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; 2206#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2223#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; 2222#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2221#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; 2220#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2219#L536-3 assume !(main_~i~1 < main_~array_size~0); 2209#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; 2202#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; 2193#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); 2194#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2210#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2231#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); 2226#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2225#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2224#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2197#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); 2198#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2199#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; 2229#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); 2218#L521 [2019-11-28 21:26:26,399 INFO L796 eck$LassoCheckResult]: Loop: 2218#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2215#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2216#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); 2218#L521 [2019-11-28 21:26:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:26,399 INFO L82 PathProgramCache]: Analyzing trace with hash 417927685, now seen corresponding path program 1 times [2019-11-28 21:26:26,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:26,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108528593] [2019-11-28 21:26:26,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:26,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108528593] [2019-11-28 21:26:26,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425085366] [2019-11-28 21:26:26,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:26:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:26,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 21:26:26,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:26,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:26:26,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-28 21:26:26,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433513219] [2019-11-28 21:26:26,675 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:26:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 3 times [2019-11-28 21:26:26,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:26,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648927598] [2019-11-28 21:26:26,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:26,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:26,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 21:26:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-28 21:26:26,777 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. cyclomatic complexity: 20 Second operand 21 states. [2019-11-28 21:26:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:27,136 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2019-11-28 21:26:27,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 21:26:27,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2019-11-28 21:26:27,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:27,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 42 states and 55 transitions. [2019-11-28 21:26:27,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 21:26:27,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 21:26:27,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 55 transitions. [2019-11-28 21:26:27,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:27,140 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-11-28 21:26:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 55 transitions. [2019-11-28 21:26:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-11-28 21:26:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 21:26:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-11-28 21:26:27,143 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-28 21:26:27,143 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-28 21:26:27,143 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 21:26:27,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-11-28 21:26:27,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:26:27,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:27,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:27,144 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:27,144 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:26:27,145 INFO L794 eck$LassoCheckResult]: Stem: 2412#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2407#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; 2408#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2413#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; 2405#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; 2401#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2402#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; 2406#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2423#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; 2422#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2421#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; 2420#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2419#L536-3 assume !(main_~i~1 < main_~array_size~0); 2409#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; 2403#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; 2394#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); 2395#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2410#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2396#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); 2397#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2411#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2416#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); 2426#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2425#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2424#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2398#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); 2399#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2400#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; 2404#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); 2417#L521 [2019-11-28 21:26:27,145 INFO L796 eck$LassoCheckResult]: Loop: 2417#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2414#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2415#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); 2417#L521 [2019-11-28 21:26:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1663183504, now seen corresponding path program 2 times [2019-11-28 21:26:27,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:27,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108331758] [2019-11-28 21:26:27,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,176 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:27,176 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 4 times [2019-11-28 21:26:27,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:27,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524135191] [2019-11-28 21:26:27,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,182 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1157082835, now seen corresponding path program 4 times [2019-11-28 21:26:27,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:27,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704602867] [2019-11-28 21:26:27,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:27,232 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:28,788 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 251 DAG size of output: 185 [2019-11-28 21:26:29,098 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-28 21:26:29,101 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:29,101 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:29,101 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:29,101 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:29,101 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:29,101 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:29,102 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:29,102 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:29,102 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration14_Lasso [2019-11-28 21:26:29,102 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:29,102 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:29,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:29,410 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:316) 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) [2019-11-28 21:26:29,413 INFO L168 Benchmark]: Toolchain (without parser) took 20852.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 471.3 MB). Free memory was 955.0 MB in the beginning and 1.4 GB in the end (delta: -491.8 MB). Peak memory consumption was 520.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:29,414 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:29,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:29,417 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.57 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:29,417 INFO L168 Benchmark]: Boogie Preprocessor took 43.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:29,417 INFO L168 Benchmark]: RCFGBuilder took 364.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:29,418 INFO L168 Benchmark]: BuchiAutomizer took 19745.86 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 328.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -351.9 MB). Peak memory consumption was 517.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:29,422 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 633.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.57 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.97 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 364.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19745.86 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 328.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -351.9 MB). Peak memory consumption was 517.6 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...