./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:13:59,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:13:59,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:13:59,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:13:59,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:13:59,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:13:59,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:13:59,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:13:59,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:13:59,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:13:59,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:13:59,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:13:59,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:13:59,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:13:59,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:13:59,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:13:59,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:13:59,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:13:59,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:13:59,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:13:59,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:13:59,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:13:59,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:13:59,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:13:59,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:13:59,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:13:59,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:13:59,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:13:59,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:13:59,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:13:59,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:13:59,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:13:59,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:13:59,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:13:59,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:13:59,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:13:59,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:13:59,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:13:59,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:13:59,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:13:59,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:13:59,367 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-12-07 17:13:59,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:13:59,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:13:59,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:13:59,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:13:59,382 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:13:59,382 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 17:13:59,382 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 17:13:59,382 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 17:13:59,382 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 17:13:59,382 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 17:13:59,382 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 17:13:59,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:13:59,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:13:59,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:13:59,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:13:59,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 17:13:59,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 17:13:59,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 17:13:59,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:13:59,384 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 17:13:59,384 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:13:59,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 17:13:59,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:13:59,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:13:59,384 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 17:13:59,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:13:59,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:13:59,385 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:13:59,385 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 17:13:59,385 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 17:13:59,386 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf [2019-12-07 17:13:59,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:13:59,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:13:59,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:13:59,505 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:13:59,505 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:13:59,505 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2019-12-07 17:13:59,552 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/data/8b94d5881/aaf6d7e687b44c86879be6a97bd2a6fb/FLAGb943105e6 [2019-12-07 17:13:59,946 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:13:59,946 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2019-12-07 17:13:59,955 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/data/8b94d5881/aaf6d7e687b44c86879be6a97bd2a6fb/FLAGb943105e6 [2019-12-07 17:14:00,327 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/data/8b94d5881/aaf6d7e687b44c86879be6a97bd2a6fb [2019-12-07 17:14:00,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:14:00,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:14:00,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:14:00,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:14:00,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:14:00,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388735a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00, skipping insertion in model container [2019-12-07 17:14:00,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:14:00,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:14:00,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:14:00,575 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:14:00,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:14:00,631 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:14:00,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00 WrapperNode [2019-12-07 17:14:00,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:14:00,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:14:00,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:14:00,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:14:00,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:14:00,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:14:00,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:14:00,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:14:00,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (1/1) ... [2019-12-07 17:14:00,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:14:00,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:14:00,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:14:00,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:14:00,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:14:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:14:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:14:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:14:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:14:00,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:14:00,862 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:14:00,862 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:14:00,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:00 BoogieIcfgContainer [2019-12-07 17:14:00,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:14:00,864 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 17:14:00,864 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 17:14:00,866 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 17:14:00,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 17:14:00,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 05:14:00" (1/3) ... [2019-12-07 17:14:00,867 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@630d9412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 05:14:00, skipping insertion in model container [2019-12-07 17:14:00,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 17:14:00,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:00" (2/3) ... [2019-12-07 17:14:00,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@630d9412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 05:14:00, skipping insertion in model container [2019-12-07 17:14:00,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 17:14:00,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:00" (3/3) ... [2019-12-07 17:14:00,869 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-2.i [2019-12-07 17:14:00,903 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 17:14:00,903 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 17:14:00,903 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 17:14:00,903 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:14:00,903 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:14:00,904 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 17:14:00,904 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:14:00,904 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 17:14:00,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-12-07 17:14:00,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 17:14:00,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:00,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:00,930 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 17:14:00,930 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 17:14:00,930 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 17:14:00,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-12-07 17:14:00,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 17:14:00,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:00,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:00,932 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 17:14:00,932 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 17:14:00,937 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 7#L566true assume !(main_~array_size~0 < 1); 9#L566-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 4#L550-3true [2019-12-07 17:14:00,937 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 12#L554-3true assume !true; 14#L554-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3#L550-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 4#L550-3true [2019-12-07 17:14:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-12-07 17:14:00,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:00,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155564942] [2019-12-07 17:14:00,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:01,030 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2019-12-07 17:14:01,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:01,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315359511] [2019-12-07 17:14:01,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:01,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315359511] [2019-12-07 17:14:01,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:01,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:14:01,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728673452] [2019-12-07 17:14:01,056 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 17:14:01,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:01,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 17:14:01,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:14:01,068 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-12-07 17:14:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:01,072 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-12-07 17:14:01,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:14:01,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-12-07 17:14:01,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 17:14:01,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-12-07 17:14:01,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 17:14:01,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 17:14:01,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-12-07 17:14:01,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 17:14:01,078 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-12-07 17:14:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-12-07 17:14:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-12-07 17:14:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 17:14:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-12-07 17:14:01,095 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-12-07 17:14:01,096 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-12-07 17:14:01,096 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 17:14:01,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-12-07 17:14:01,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 17:14:01,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:01,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:01,097 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 17:14:01,097 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 17:14:01,097 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 38#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 39#L566 assume !(main_~array_size~0 < 1); 40#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 37#L550-3 [2019-12-07 17:14:01,097 INFO L796 eck$LassoCheckResult]: Loop: 37#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 36#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 37#L550-3 [2019-12-07 17:14:01,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:01,097 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-12-07 17:14:01,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:01,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652448] [2019-12-07 17:14:01,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:01,115 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2019-12-07 17:14:01,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:01,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907178399] [2019-12-07 17:14:01,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:01,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907178399] [2019-12-07 17:14:01,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:01,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:14:01,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843235952] [2019-12-07 17:14:01,143 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 17:14:01,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:01,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:14:01,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:14:01,143 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-12-07 17:14:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:01,157 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-12-07 17:14:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:14:01,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2019-12-07 17:14:01,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 17:14:01,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2019-12-07 17:14:01,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 17:14:01,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 17:14:01,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-12-07 17:14:01,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 17:14:01,159 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-12-07 17:14:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-12-07 17:14:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-12-07 17:14:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 17:14:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-12-07 17:14:01,161 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-12-07 17:14:01,161 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-12-07 17:14:01,161 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 17:14:01,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-12-07 17:14:01,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 17:14:01,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:01,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:01,162 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 17:14:01,162 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:01,162 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 63#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 64#L566 assume !(main_~array_size~0 < 1); 65#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 66#L550-3 [2019-12-07 17:14:01,162 INFO L796 eck$LassoCheckResult]: Loop: 66#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 69#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 72#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 67#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 66#L550-3 [2019-12-07 17:14:01,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:01,162 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-12-07 17:14:01,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:01,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929049109] [2019-12-07 17:14:01,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:01,176 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:01,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:01,177 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2019-12-07 17:14:01,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:01,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221166290] [2019-12-07 17:14:01,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:01,199 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:01,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2019-12-07 17:14:01,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:01,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764767057] [2019-12-07 17:14:01,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:01,231 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:01,480 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:14:01,480 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:14:01,480 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:14:01,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:14:01,481 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:14:01,481 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:01,481 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:14:01,481 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:14:01,481 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration3_Lasso [2019-12-07 17:14:01,481 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:14:01,481 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:14:01,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-12-07 17:14:01,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,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-12-07 17:14:01,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-12-07 17:14:01,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:01,893 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:14:01,898 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:01,902 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-12-07 17:14:01,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:01,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:01,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:01,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:01,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:01,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:01,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:01,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:01,920 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-12-07 17:14:01,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:01,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:01,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:01,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:01,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:01,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:01,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:01,940 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-12-07 17:14:01,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:01,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:01,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:01,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:01,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:01,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:01,969 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:14:02,008 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-12-07 17:14:02,008 INFO L444 ModelExtractionUtils]: 16 out of 40 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:02,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:14:02,022 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 17:14:02,023 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:14:02,023 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_~i~0) = 1*ULTIMATE.start_SelectionSort_~array_size - 1*ULTIMATE.start_SelectionSort_~i~0 Supporting invariants [] [2019-12-07 17:14:02,037 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-12-07 17:14:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:02,077 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:02,078 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:02,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:02,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:02,110 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-12-07 17:14:02,111 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-12-07 17:14:02,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 18 states and 24 transitions. Complement of second has 4 states. [2019-12-07 17:14:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-12-07 17:14:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 17:14:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-12-07 17:14:02,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 7 letters. [2019-12-07 17:14:02,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:02,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 7 letters. [2019-12-07 17:14:02,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:02,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 14 letters. [2019-12-07 17:14:02,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:02,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-12-07 17:14:02,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:02,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2019-12-07 17:14:02,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-12-07 17:14:02,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-12-07 17:14:02,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-12-07 17:14:02,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:14:02,155 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-12-07 17:14:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-12-07 17:14:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-12-07 17:14:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 17:14:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-12-07 17:14:02,157 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-12-07 17:14:02,157 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-12-07 17:14:02,157 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 17:14:02,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-12-07 17:14:02,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:02,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:02,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:02,158 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 17:14:02,158 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:14:02,159 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 157#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 158#L566 assume !(main_~array_size~0 < 1); 159#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 160#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 165#L554-3 [2019-12-07 17:14:02,159 INFO L796 eck$LassoCheckResult]: Loop: 165#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 169#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 166#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 165#L554-3 [2019-12-07 17:14:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-12-07 17:14:02,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:02,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512260760] [2019-12-07 17:14:02,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:02,187 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-12-07 17:14:02,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:02,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125366107] [2019-12-07 17:14:02,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:02,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:02,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-12-07 17:14:02,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:02,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41971176] [2019-12-07 17:14:02,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:02,223 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:02,364 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:14:02,364 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:14:02,364 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:14:02,364 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:14:02,364 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:14:02,364 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:02,364 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:14:02,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:14:02,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration4_Lasso [2019-12-07 17:14:02,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:14:02,365 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:14:02,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,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-12-07 17:14:02,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,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-12-07 17:14:02,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:02,718 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:14:02,718 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:02,725 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-12-07 17:14:02,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:02,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:02,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:02,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:02,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:02,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:02,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:02,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:02,732 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-12-07 17:14:02,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:02,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:02,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:02,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:02,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:02,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:02,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:02,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:02,739 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-12-07 17:14:02,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:02,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:02,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:02,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:02,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:02,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:02,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:02,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:02,745 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-12-07 17:14:02,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:02,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:02,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:02,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:02,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:02,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:02,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:02,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:02,753 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-12-07 17:14:02,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:02,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:02,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:02,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:02,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:02,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:02,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:02,762 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-12-07 17:14:02,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:02,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:02,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:02,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:02,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:02,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:02,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:02,773 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-12-07 17:14:02,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:02,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:02,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:02,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:02,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:02,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:02,799 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:14:02,820 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-12-07 17:14:02,820 INFO L444 ModelExtractionUtils]: 23 out of 40 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:02,823 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:14:02,828 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 17:14:02,828 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:14:02,828 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-12-07 17:14:02,837 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-12-07 17:14:02,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:02,852 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:02,852 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:02,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:02,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:02,863 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-12-07 17:14:02,863 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-12-07 17:14:02,877 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2019-12-07 17:14:02,878 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-12-07 17:14:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 17:14:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-12-07 17:14:02,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-12-07 17:14:02,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:02,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-12-07 17:14:02,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:02,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2019-12-07 17:14:02,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:02,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-12-07 17:14:02,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:02,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2019-12-07 17:14:02,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-12-07 17:14:02,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-12-07 17:14:02,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-12-07 17:14:02,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:14:02,883 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-12-07 17:14:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-12-07 17:14:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2019-12-07 17:14:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 17:14:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-12-07 17:14:02,885 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-12-07 17:14:02,885 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-12-07 17:14:02,885 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 17:14:02,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-12-07 17:14:02,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:02,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:02,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:02,886 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:02,886 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:14:02,886 INFO L794 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 269#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 270#L566 assume !(main_~array_size~0 < 1); 271#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 272#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 276#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 282#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 279#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 280#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 283#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 273#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 274#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 277#L554-3 [2019-12-07 17:14:02,886 INFO L796 eck$LassoCheckResult]: Loop: 277#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 281#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 278#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 277#L554-3 [2019-12-07 17:14:02,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:02,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2019-12-07 17:14:02,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:02,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731706928] [2019-12-07 17:14:02,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:02,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731706928] [2019-12-07 17:14:02,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603779605] [2019-12-07 17:14:02,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:02,957 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:14:02,957 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:02,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:14:02,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-07 17:14:02,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820607778] [2019-12-07 17:14:02,966 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 17:14:02,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:02,966 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-12-07 17:14:02,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:02,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079336456] [2019-12-07 17:14:02,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:02,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:03,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:03,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:14:03,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:14:03,007 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-12-07 17:14:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:03,041 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-12-07 17:14:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:14:03,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-12-07 17:14:03,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:03,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2019-12-07 17:14:03,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-12-07 17:14:03,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-12-07 17:14:03,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2019-12-07 17:14:03,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:14:03,043 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-12-07 17:14:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2019-12-07 17:14:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2019-12-07 17:14:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 17:14:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-12-07 17:14:03,044 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-12-07 17:14:03,044 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-12-07 17:14:03,045 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 17:14:03,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-12-07 17:14:03,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:03,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:03,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:03,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:03,045 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:14:03,046 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 359#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 360#L566 assume !(main_~array_size~0 < 1); 361#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 362#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 366#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 376#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 369#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 370#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 372#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 373#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 375#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 374#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 363#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 364#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 367#L554-3 [2019-12-07 17:14:03,046 INFO L796 eck$LassoCheckResult]: Loop: 367#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 371#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 368#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 367#L554-3 [2019-12-07 17:14:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:03,046 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2019-12-07 17:14:03,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:03,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690649094] [2019-12-07 17:14:03,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:03,077 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:03,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:03,078 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-12-07 17:14:03,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:03,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628706058] [2019-12-07 17:14:03,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:03,086 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:03,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2019-12-07 17:14:03,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:03,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896636951] [2019-12-07 17:14:03,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:03,128 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:03,381 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 108 [2019-12-07 17:14:03,429 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:14:03,429 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:14:03,429 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:14:03,429 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:14:03,429 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:14:03,430 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:03,430 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:14:03,430 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:14:03,430 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration6_Lasso [2019-12-07 17:14:03,430 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:14:03,430 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:14:03,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,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-12-07 17:14:03,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,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-12-07 17:14:03,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,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-12-07 17:14:03,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:03,813 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:14:03,813 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:03,816 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-12-07 17:14:03,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:03,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:03,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:03,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:03,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:03,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:03,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:03,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:03,824 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-12-07 17:14:03,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:03,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:03,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:03,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:03,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:03,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:03,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:03,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:14:03,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:03,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:03,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:03,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:03,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:03,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:03,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:03,845 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-12-07 17:14:03,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:03,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:03,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:03,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:03,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:03,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:03,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:03,855 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-12-07 17:14:03,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:03,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:03,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:03,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:03,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:03,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:03,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:03,865 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-12-07 17:14:03,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:03,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:03,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:03,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:03,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:03,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:03,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:03,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:03,872 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-12-07 17:14:03,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:03,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:03,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:03,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:03,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:03,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:03,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:03,884 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-12-07 17:14:03,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:03,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:03,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:03,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:03,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:03,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:03,906 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:14:03,926 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-12-07 17:14:03,926 INFO L444 ModelExtractionUtils]: 11 out of 31 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:03,929 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:14:03,931 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 17:14:03,931 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:14:03,931 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = -8*ULTIMATE.start_SelectionSort_~j~0 + 5*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~array_size + 3 >= 0] [2019-12-07 17:14:03,948 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-12-07 17:14:03,950 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 17:14:03,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:03,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:03,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:04,017 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:04,018 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:04,031 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-12-07 17:14:04,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-12-07 17:14:04,046 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-12-07 17:14:04,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2019-12-07 17:14:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 17:14:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-12-07 17:14:04,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 3 letters. [2019-12-07 17:14:04,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:04,047 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:04,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:04,072 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:04,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:04,114 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:04,126 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2019-12-07 17:14:04,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-12-07 17:14:04,141 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-12-07 17:14:04,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2019-12-07 17:14:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 17:14:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-12-07 17:14:04,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 3 letters. [2019-12-07 17:14:04,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:04,142 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:04,168 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:04,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:04,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:04,213 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:04,225 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-12-07 17:14:04,225 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-12-07 17:14:04,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 60 states and 84 transitions. Complement of second has 15 states. [2019-12-07 17:14:04,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2019-12-07 17:14:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 17:14:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2019-12-07 17:14:04,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 15 letters. Loop has 3 letters. [2019-12-07 17:14:04,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:04,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 18 letters. Loop has 3 letters. [2019-12-07 17:14:04,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:04,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 15 letters. Loop has 6 letters. [2019-12-07 17:14:04,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:04,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 84 transitions. [2019-12-07 17:14:04,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:04,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 46 transitions. [2019-12-07 17:14:04,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-12-07 17:14:04,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 17:14:04,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 46 transitions. [2019-12-07 17:14:04,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:14:04,400 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2019-12-07 17:14:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 46 transitions. [2019-12-07 17:14:04,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2019-12-07 17:14:04,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 17:14:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-12-07 17:14:04,402 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-12-07 17:14:04,402 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-12-07 17:14:04,402 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 17:14:04,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-12-07 17:14:04,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:04,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:04,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:04,404 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:04,404 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:14:04,404 INFO L794 eck$LassoCheckResult]: Stem: 755#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 751#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 752#L566 assume !(main_~array_size~0 < 1); 753#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 754#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 756#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 769#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 760#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 757#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 762#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 763#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 768#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 766#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 767#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 765#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 764#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 749#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 750#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 758#L554-3 [2019-12-07 17:14:04,404 INFO L796 eck$LassoCheckResult]: Loop: 758#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 761#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 759#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 758#L554-3 [2019-12-07 17:14:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash 661745927, now seen corresponding path program 3 times [2019-12-07 17:14:04,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:04,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316736122] [2019-12-07 17:14:04,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:04,424 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:04,424 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-12-07 17:14:04,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:04,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505096518] [2019-12-07 17:14:04,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:04,438 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:04,439 INFO L82 PathProgramCache]: Analyzing trace with hash 173047542, now seen corresponding path program 2 times [2019-12-07 17:14:04,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:04,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21496179] [2019-12-07 17:14:04,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:04,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:04,781 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2019-12-07 17:14:04,831 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:14:04,832 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:14:04,832 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:14:04,832 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:14:04,832 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:14:04,832 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:04,832 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:14:04,832 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:14:04,832 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration7_Lasso [2019-12-07 17:14:04,832 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:14:04,832 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:14:04,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:04,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:04,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:04,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:04,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:04,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:04,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:04,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:04,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:05,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:05,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:05,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:05,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:05,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:05,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:05,240 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:14:05,240 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:05,243 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-12-07 17:14:05,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:05,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:05,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:05,250 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-12-07 17:14:05,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:05,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:05,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:05,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:05,256 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-12-07 17:14:05,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:05,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:05,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:05,265 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-12-07 17:14:05,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:05,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:05,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:05,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:05,272 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-12-07 17:14:05,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:05,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:05,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:05,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:05,278 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-12-07 17:14:05,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:05,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:05,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:05,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:05,285 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-12-07 17:14:05,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:05,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:05,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:05,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:05,291 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-12-07 17:14:05,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:05,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:05,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:05,299 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-12-07 17:14:05,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:05,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:05,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:05,311 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-12-07 17:14:05,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:05,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:05,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:05,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:14:05,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:05,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:05,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:05,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:05,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:05,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:05,342 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:14:05,360 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-12-07 17:14:05,360 INFO L444 ModelExtractionUtils]: 20 out of 40 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:05,362 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:14:05,364 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 17:14:05,365 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:14:05,365 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_~min~0) = 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_4 - 1*ULTIMATE.start_SelectionSort_~a.offset - 4*ULTIMATE.start_SelectionSort_~min~0 Supporting invariants [1*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~min~0 - 1 >= 0] [2019-12-07 17:14:05,393 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-12-07 17:14:05,395 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 17:14:05,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:05,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:05,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:05,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:05,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:05,457 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-12-07 17:14:05,458 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-12-07 17:14:05,514 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 8 states. [2019-12-07 17:14:05,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2019-12-07 17:14:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 17:14:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-12-07 17:14:05,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 18 letters. Loop has 3 letters. [2019-12-07 17:14:05,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:05,515 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:05,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:05,547 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:05,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:05,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:05,553 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:05,587 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-12-07 17:14:05,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-12-07 17:14:05,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2019-12-07 17:14:05,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-12-07 17:14:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 17:14:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-12-07 17:14:05,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 18 letters. Loop has 3 letters. [2019-12-07 17:14:05,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:05,635 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:05,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:05,662 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:05,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:05,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:05,692 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-12-07 17:14:05,692 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-12-07 17:14:05,765 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 57 states and 72 transitions. Complement of second has 7 states. [2019-12-07 17:14:05,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2019-12-07 17:14:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 17:14:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-12-07 17:14:05,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 18 letters. Loop has 3 letters. [2019-12-07 17:14:05,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:05,766 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:05,796 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:05,797 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:05,801 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:05,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:05,833 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-12-07 17:14:05,833 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-12-07 17:14:05,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 50 states and 66 transitions. Complement of second has 8 states. [2019-12-07 17:14:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-12-07 17:14:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 17:14:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-12-07 17:14:05,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 3 letters. [2019-12-07 17:14:05,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:05,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 21 letters. Loop has 3 letters. [2019-12-07 17:14:05,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:05,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 6 letters. [2019-12-07 17:14:05,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:05,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-12-07 17:14:05,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:05,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 43 states and 57 transitions. [2019-12-07 17:14:05,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-12-07 17:14:05,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 17:14:05,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2019-12-07 17:14:05,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:14:05,883 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-12-07 17:14:05,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2019-12-07 17:14:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-12-07 17:14:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 17:14:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2019-12-07 17:14:05,885 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2019-12-07 17:14:05,885 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2019-12-07 17:14:05,885 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 17:14:05,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2019-12-07 17:14:05,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:05,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:05,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:05,886 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:05,886 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:14:05,886 INFO L794 eck$LassoCheckResult]: Stem: 1361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1355#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1356#L566 assume !(main_~array_size~0 < 1); 1357#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 1358#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1362#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1370#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 1372#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1363#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1392#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1390#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1386#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1376#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1385#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1375#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1374#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1359#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1360#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1364#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1369#L556 [2019-12-07 17:14:05,886 INFO L796 eck$LassoCheckResult]: Loop: 1369#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1365#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1366#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1369#L556 [2019-12-07 17:14:05,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:05,886 INFO L82 PathProgramCache]: Analyzing trace with hash -373906704, now seen corresponding path program 3 times [2019-12-07 17:14:05,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:05,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963315080] [2019-12-07 17:14:05,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:05,908 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:05,908 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 1 times [2019-12-07 17:14:05,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:05,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824080486] [2019-12-07 17:14:05,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:05,912 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:05,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2090576807, now seen corresponding path program 4 times [2019-12-07 17:14:05,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:05,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873807601] [2019-12-07 17:14:05,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:05,934 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:06,292 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 130 [2019-12-07 17:14:06,361 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:14:06,361 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:14:06,361 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:14:06,361 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:14:06,361 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:14:06,361 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:06,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:14:06,362 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:14:06,362 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration8_Lasso [2019-12-07 17:14:06,362 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:14:06,362 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:14:06,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-12-07 17:14:06,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,569 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-12-07 17:14:06,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:06,945 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:14:06,945 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:06,948 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-12-07 17:14:06,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:06,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:06,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:06,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:06,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:06,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:06,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:06,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:06,957 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-12-07 17:14:06,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:06,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:06,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:06,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:06,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:06,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:06,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:06,968 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-12-07 17:14:06,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:06,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:06,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:06,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:06,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:06,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:06,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:06,980 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-12-07 17:14:06,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:06,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:06,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:06,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:06,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:06,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:06,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:07,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-12-07 17:14:07,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:07,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:07,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:07,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:07,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:07,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:07,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:14:07,056 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-12-07 17:14:07,056 INFO L444 ModelExtractionUtils]: 5 out of 37 variables were initially zero. Simplification set additionally 27 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:07,058 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:14:07,060 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 17:14:07,060 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:14:07,061 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~min~0) = -2*ULTIMATE.start_SelectionSort_~j~0 + 13*ULTIMATE.start_SelectionSort_~min~0 Supporting invariants [16*ULTIMATE.start_SelectionSort_~min~0 - 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_5 >= 0] [2019-12-07 17:14:07,108 INFO L297 tatePredicateManager]: 17 out of 19 supporting invariants were superfluous and have been removed [2019-12-07 17:14:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:07,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 17:14:07,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:07,184 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-12-07 17:14:07,184 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:07,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:07,195 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:07,195 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-12-07 17:14:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:07,352 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:14:07,352 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:07,368 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-12-07 17:14:07,368 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-12-07 17:14:07,403 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 40 states and 54 transitions. Complement of second has 5 states. [2019-12-07 17:14:07,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-12-07 17:14:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 17:14:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-12-07 17:14:07,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 19 letters. Loop has 3 letters. [2019-12-07 17:14:07,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:07,404 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:07,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:07,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 17:14:07,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:07,440 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-12-07 17:14:07,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:07,446 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:07,446 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:07,446 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-12-07 17:14:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:07,577 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:14:07,578 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:07,593 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2019-12-07 17:14:07,593 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-12-07 17:14:07,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 40 states and 54 transitions. Complement of second has 5 states. [2019-12-07 17:14:07,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-12-07 17:14:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 17:14:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-12-07 17:14:07,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 19 letters. Loop has 3 letters. [2019-12-07 17:14:07,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:07,629 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:07,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 17:14:07,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:07,662 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-12-07 17:14:07,662 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:07,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:07,668 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:07,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-12-07 17:14:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:07,801 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:14:07,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:07,816 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-12-07 17:14:07,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-12-07 17:14:09,077 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 286 states and 366 transitions. Complement of second has 46 states. [2019-12-07 17:14:09,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 18 stem states 2 non-accepting loop states 2 accepting loop states [2019-12-07 17:14:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 17:14:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 116 transitions. [2019-12-07 17:14:09,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 116 transitions. Stem has 19 letters. Loop has 3 letters. [2019-12-07 17:14:09,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:09,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 116 transitions. Stem has 22 letters. Loop has 3 letters. [2019-12-07 17:14:09,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:09,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 116 transitions. Stem has 19 letters. Loop has 6 letters. [2019-12-07 17:14:09,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:09,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 366 transitions. [2019-12-07 17:14:09,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 17:14:09,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 234 states and 310 transitions. [2019-12-07 17:14:09,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-12-07 17:14:09,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-12-07 17:14:09,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 310 transitions. [2019-12-07 17:14:09,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:14:09,085 INFO L688 BuchiCegarLoop]: Abstraction has 234 states and 310 transitions. [2019-12-07 17:14:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 310 transitions. [2019-12-07 17:14:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 85. [2019-12-07 17:14:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 17:14:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 119 transitions. [2019-12-07 17:14:09,091 INFO L711 BuchiCegarLoop]: Abstraction has 85 states and 119 transitions. [2019-12-07 17:14:09,091 INFO L591 BuchiCegarLoop]: Abstraction has 85 states and 119 transitions. [2019-12-07 17:14:09,091 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 17:14:09,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 119 transitions. [2019-12-07 17:14:09,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:09,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:09,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:09,092 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:09,092 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:14:09,092 INFO L794 eck$LassoCheckResult]: Stem: 2188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2180#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 2181#L566 assume !(main_~array_size~0 < 1); 2182#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 2183#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 2184#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2244#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 2243#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2240#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2235#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 2233#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2231#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2217#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 2230#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2229#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2198#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2178#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2179#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 2193#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2194#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 2248#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2200#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2195#L556 [2019-12-07 17:14:09,092 INFO L796 eck$LassoCheckResult]: Loop: 2195#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 2189#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2190#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2195#L556 [2019-12-07 17:14:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2090574885, now seen corresponding path program 5 times [2019-12-07 17:14:09,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:09,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259176988] [2019-12-07 17:14:09,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:09,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 2 times [2019-12-07 17:14:09,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:09,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362384895] [2019-12-07 17:14:09,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:09,116 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1004330414, now seen corresponding path program 6 times [2019-12-07 17:14:09,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:09,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497089967] [2019-12-07 17:14:09,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:09,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497089967] [2019-12-07 17:14:09,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183885902] [2019-12-07 17:14:09,219 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:09,259 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-07 17:14:09,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:14:09,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:14:09,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:09,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:14:09,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-12-07 17:14:09,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023928544] [2019-12-07 17:14:09,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:09,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 17:14:09,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:14:09,385 INFO L87 Difference]: Start difference. First operand 85 states and 119 transitions. cyclomatic complexity: 38 Second operand 21 states. [2019-12-07 17:14:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:09,671 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2019-12-07 17:14:09,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:14:09,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 192 transitions. [2019-12-07 17:14:09,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:09,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 99 states and 128 transitions. [2019-12-07 17:14:09,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 17:14:09,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 17:14:09,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 128 transitions. [2019-12-07 17:14:09,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:14:09,675 INFO L688 BuchiCegarLoop]: Abstraction has 99 states and 128 transitions. [2019-12-07 17:14:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 128 transitions. [2019-12-07 17:14:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 48. [2019-12-07 17:14:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 17:14:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2019-12-07 17:14:09,678 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-12-07 17:14:09,678 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-12-07 17:14:09,678 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 17:14:09,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2019-12-07 17:14:09,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:09,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:09,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:09,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:09,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:14:09,680 INFO L794 eck$LassoCheckResult]: Stem: 2545#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2539#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 2540#L566 assume !(main_~array_size~0 < 1); 2541#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 2542#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 2546#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2585#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 2583#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2580#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2579#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 2578#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2571#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2569#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 2567#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2565#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2558#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 2563#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2557#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2556#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2543#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2544#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 2547#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2552#L556 [2019-12-07 17:14:09,680 INFO L796 eck$LassoCheckResult]: Loop: 2552#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 2548#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2549#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2552#L556 [2019-12-07 17:14:09,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:09,680 INFO L82 PathProgramCache]: Analyzing trace with hash 85276535, now seen corresponding path program 7 times [2019-12-07 17:14:09,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:09,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067692190] [2019-12-07 17:14:09,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:09,697 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:09,697 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 3 times [2019-12-07 17:14:09,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:09,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591485437] [2019-12-07 17:14:09,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:09,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:09,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:09,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2147355200, now seen corresponding path program 8 times [2019-12-07 17:14:09,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:09,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361358715] [2019-12-07 17:14:09,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:09,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:10,200 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 147 [2019-12-07 17:14:10,284 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:14:10,284 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:14:10,285 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:14:10,285 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:14:10,285 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:14:10,285 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:10,285 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:14:10,285 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:14:10,285 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration10_Lasso [2019-12-07 17:14:10,285 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:14:10,285 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:14:10,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:10,793 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:14:10,793 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,797 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-12-07 17:14:10,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:10,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:10,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:10,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:10,803 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-12-07 17:14:10,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:10,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:10,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,810 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-12-07 17:14:10,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:10,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:10,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:10,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,817 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-12-07 17:14:10,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:10,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:10,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:10,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,822 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-12-07 17:14:10,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:10,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:10,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,830 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-12-07 17:14:10,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:10,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:10,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:10,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,837 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-12-07 17:14:10,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:10,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:10,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:10,845 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-12-07 17:14:10,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:10,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:10,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:10,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,852 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-12-07 17:14:10,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:10,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:10,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,860 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-12-07 17:14:10,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:10,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:10,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:10,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:10,867 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-12-07 17:14:10,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:10,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:10,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:10,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,873 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-12-07 17:14:10,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:10,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:10,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14: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-12-07 17:14:10,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:10,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:10,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:10,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,893 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-12-07 17:14:10,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:10,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:10,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,903 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-12-07 17:14:10,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:14:10,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:14:10,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:14:10,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,910 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-12-07 17:14:10,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:10,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:10,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:10,921 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-12-07 17:14:10,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:10,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:10,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:10,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:10,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:10,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:10,938 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:14:10,972 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2019-12-07 17:14:10,972 INFO L444 ModelExtractionUtils]: 6 out of 31 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:10,974 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:14:10,976 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 17:14:10,976 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:14:10,977 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_6, ULTIMATE.start_SelectionSort_~i~0) = -4*ULTIMATE.start_SelectionSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_6 + 4*ULTIMATE.start_SelectionSort_~i~0 Supporting invariants [] [2019-12-07 17:14:11,017 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2019-12-07 17:14:11,019 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 17:14:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:11,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:11,054 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:11,066 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:11,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:11,079 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-12-07 17:14:11,079 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-12-07 17:14:11,114 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 89 states and 112 transitions. Complement of second has 8 states. [2019-12-07 17:14:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 17:14:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-12-07 17:14:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-12-07 17:14:11,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 22 letters. Loop has 3 letters. [2019-12-07 17:14:11,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:11,115 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:11,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:11,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:11,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:11,159 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:11,170 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-12-07 17:14:11,171 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-12-07 17:14:11,205 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 89 states and 112 transitions. Complement of second has 8 states. [2019-12-07 17:14:11,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 17:14:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-12-07 17:14:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-12-07 17:14:11,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 22 letters. Loop has 3 letters. [2019-12-07 17:14:11,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:11,206 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:11,239 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:11,240 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:11,249 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:14:11,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:11,262 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-12-07 17:14:11,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-12-07 17:14:11,317 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 93 states and 116 transitions. Complement of second has 8 states. [2019-12-07 17:14:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2019-12-07 17:14:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-12-07 17:14:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2019-12-07 17:14:11,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 22 letters. Loop has 3 letters. [2019-12-07 17:14:11,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:11,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 25 letters. Loop has 3 letters. [2019-12-07 17:14:11,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:11,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 22 letters. Loop has 6 letters. [2019-12-07 17:14:11,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:11,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 116 transitions. [2019-12-07 17:14:11,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:11,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 71 states and 91 transitions. [2019-12-07 17:14:11,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-12-07 17:14:11,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-12-07 17:14:11,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 91 transitions. [2019-12-07 17:14:11,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:14:11,320 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 91 transitions. [2019-12-07 17:14:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 91 transitions. [2019-12-07 17:14:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2019-12-07 17:14:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 17:14:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2019-12-07 17:14:11,322 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2019-12-07 17:14:11,322 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2019-12-07 17:14:11,322 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 17:14:11,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 73 transitions. [2019-12-07 17:14:11,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 17:14:11,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:14:11,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:14:11,323 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:11,323 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:14:11,323 INFO L794 eck$LassoCheckResult]: Stem: 3222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3216#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 3217#L566 assume !(main_~array_size~0 < 1); 3218#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 3219#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 3223#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3265#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 3264#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3263#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3260#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 3258#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3255#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3254#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 3253#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3249#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3247#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 3239#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3240#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 3233#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3220#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 3221#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 3224#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3229#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 3235#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3234#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3232#L556 [2019-12-07 17:14:11,323 INFO L796 eck$LassoCheckResult]: Loop: 3232#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 3225#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3226#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3232#L556 [2019-12-07 17:14:11,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2147357122, now seen corresponding path program 9 times [2019-12-07 17:14:11,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:11,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097401161] [2019-12-07 17:14:11,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:11,339 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:11,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:11,339 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 4 times [2019-12-07 17:14:11,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:11,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320765498] [2019-12-07 17:14:11,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:11,343 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:11,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1621882265, now seen corresponding path program 10 times [2019-12-07 17:14:11,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:11,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044430303] [2019-12-07 17:14:11,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:14:11,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:14:11,938 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 162 [2019-12-07 17:14:12,022 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:14:12,022 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:14:12,022 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:14:12,022 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:14:12,022 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:14:12,022 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:12,023 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:14:12,023 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:14:12,023 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration11_Lasso [2019-12-07 17:14:12,023 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:14:12,023 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:14:12,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,332 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 17:14:12,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:14:12,705 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:14:12,705 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:12,708 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-12-07 17:14:12,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:12,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:12,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:12,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:12,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:12,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:12,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:12,715 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-12-07 17:14:12,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:12,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:12,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:12,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:12,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:12,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:12,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/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-12-07 17:14:12,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-12-07 17:14:12,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:14:12,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:14:12,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:14:12,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:14:12,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:14:12,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:14:12,743 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:14:12,773 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-12-07 17:14:12,773 INFO L444 ModelExtractionUtils]: 15 out of 40 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee068bb9-4f8e-40dd-af6d-747453480a0e/bin/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:14:12,776 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:14:12,778 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 17:14:12,778 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:14:12,779 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-12-07 17:14:12,852 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2019-12-07 17:14:12,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:12,873 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:12,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:12,877 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:12,878 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:12,887 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-12-07 17:14:12,888 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-12-07 17:14:12,904 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 131 states and 164 transitions. Complement of second has 7 states. [2019-12-07 17:14:12,905 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-12-07 17:14:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 17:14:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-12-07 17:14:12,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2019-12-07 17:14:12,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:12,905 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:12,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:12,926 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:12,926 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:12,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:12,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:12,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-12-07 17:14:12,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-12-07 17:14:12,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 131 states and 164 transitions. Complement of second has 7 states. [2019-12-07 17:14:12,946 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-12-07 17:14:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 17:14:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-12-07 17:14:12,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2019-12-07 17:14:12,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:12,946 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 17:14:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:12,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:12,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:12,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:14:12,970 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:12,974 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-12-07 17:14:12,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-12-07 17:14:12,987 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 95 states and 116 transitions. Complement of second has 6 states. [2019-12-07 17:14:12,987 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-12-07 17:14:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 17:14:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-12-07 17:14:12,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 25 letters. Loop has 3 letters. [2019-12-07 17:14:12,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:12,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 28 letters. Loop has 3 letters. [2019-12-07 17:14:12,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:12,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 25 letters. Loop has 6 letters. [2019-12-07 17:14:12,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:14:12,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 116 transitions. [2019-12-07 17:14:12,989 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 17:14:12,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 0 states and 0 transitions. [2019-12-07 17:14:12,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 17:14:12,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 17:14:12,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 17:14:12,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 17:14:12,989 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:14:12,989 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:14:12,989 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:14:12,989 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 17:14:12,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:14:12,990 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 17:14:12,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 17:14:12,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 05:14:12 BoogieIcfgContainer [2019-12-07 17:14:12,994 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 17:14:12,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:14:12,994 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:14:12,994 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:14:12,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:00" (3/4) ... [2019-12-07 17:14:12,997 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:14:12,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:14:12,997 INFO L168 Benchmark]: Toolchain (without parser) took 12668.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.2 MB). Free memory was 934.4 MB in the beginning and 793.3 MB in the end (delta: 141.1 MB). Peak memory consumption was 425.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:14:12,998 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:14:12,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -126.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:14:12,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:14:12,998 INFO L168 Benchmark]: Boogie Preprocessor took 17.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:14:12,999 INFO L168 Benchmark]: RCFGBuilder took 184.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:14:12,999 INFO L168 Benchmark]: BuchiAutomizer took 12129.99 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 206.0 MB). Free memory was 1.0 GB in the beginning and 793.3 MB in the end (delta: 246.0 MB). Peak memory consumption was 452.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:14:12,999 INFO L168 Benchmark]: Witness Printer took 2.65 ms. Allocated memory is still 1.3 GB. Free memory is still 793.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:14:13,000 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -126.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 184.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12129.99 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 206.0 MB). Free memory was 1.0 GB in the beginning and 793.3 MB in the end (delta: 246.0 MB). Peak memory consumption was 452.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.65 ms. Allocated memory is still 1.3 GB. Free memory is still 793.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (4 trivial, 2 deterministic, 5 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. One nondeterministic module has affine ranking function -8 * j + 5 * unknown-#length-unknown[a] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a + -4 * min and consists of 5 locations. One nondeterministic module has affine ranking function -2 * j + 13 * min and consists of 22 locations. One nondeterministic module has affine ranking function -4 * j + unknown-#length-unknown[a] + 4 * i and consists of 6 locations. One nondeterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.0s and 12 iterations. TraceHistogramMax:6. Analysis of lassos took 8.1s. Construction of modules took 0.4s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 246 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 85 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 4, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 219 SDtfs, 519 SDslu, 251 SDs, 0 SdLazy, 576 SolverSat, 181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax108 hnf99 lsp88 ukn73 mio100 lsp66 div100 bol100 ite100 ukn100 eq170 hnf83 smp94 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...