./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/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.23-aa41828 [2018-11-23 06:39:50,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:39:50,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:39:50,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:39:50,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:39:50,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:39:50,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:39:50,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:39:50,502 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:39:50,502 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:39:50,503 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:39:50,503 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:39:50,504 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:39:50,505 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:39:50,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:39:50,506 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:39:50,507 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:39:50,508 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:39:50,510 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:39:50,511 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:39:50,512 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:39:50,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:39:50,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:39:50,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:39:50,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:39:50,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:39:50,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:39:50,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:39:50,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:39:50,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:39:50,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:39:50,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:39:50,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:39:50,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:39:50,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:39:50,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:39:50,521 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:39:50,532 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:39:50,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:39:50,533 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:39:50,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:39:50,534 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:39:50,534 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:39:50,534 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:39:50,534 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:39:50,534 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:39:50,535 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:39:50,535 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:39:50,535 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:39:50,535 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:39:50,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:39:50,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:39:50,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:39:50,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:39:50,536 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:39:50,536 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:39:50,536 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:39:50,536 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:39:50,536 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:39:50,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:39:50,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:39:50,537 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:39:50,537 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:39:50,537 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:39:50,537 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:39:50,537 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:39:50,537 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/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 [2018-11-23 06:39:50,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:39:50,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:39:50,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:39:50,571 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:39:50,572 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:39:50,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca_true-termination.c.i [2018-11-23 06:39:50,611 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/data/fec867055/a32ceb7f2f424696b3acc4b1d17408f1/FLAG17fc2cb6c [2018-11-23 06:39:50,994 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:39:50,994 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca_true-termination.c.i [2018-11-23 06:39:51,001 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/data/fec867055/a32ceb7f2f424696b3acc4b1d17408f1/FLAG17fc2cb6c [2018-11-23 06:39:51,377 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/data/fec867055/a32ceb7f2f424696b3acc4b1d17408f1 [2018-11-23 06:39:51,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:39:51,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:39:51,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:39:51,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:39:51,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:39:51,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20451cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51, skipping insertion in model container [2018-11-23 06:39:51,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:39:51,425 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:39:51,634 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:39:51,642 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:39:51,673 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:39:51,750 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:39:51,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51 WrapperNode [2018-11-23 06:39:51,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:39:51,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:39:51,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:39:51,751 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:39:51,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:39:51,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:39:51,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:39:51,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:39:51,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (1/1) ... [2018-11-23 06:39:51,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:39:51,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:39:51,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:39:51,807 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:39:51,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/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 [2018-11-23 06:39:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:39:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:39:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:39:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:39:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:39:51,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:39:52,043 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:39:52,043 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 06:39:52,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:39:52 BoogieIcfgContainer [2018-11-23 06:39:52,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:39:52,044 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:39:52,044 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:39:52,048 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:39:52,049 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:39:52,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:39:51" (1/3) ... [2018-11-23 06:39:52,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65feaea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:39:52, skipping insertion in model container [2018-11-23 06:39:52,050 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:39:52,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:51" (2/3) ... [2018-11-23 06:39:52,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65feaea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:39:52, skipping insertion in model container [2018-11-23 06:39:52,051 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:39:52,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:39:52" (3/3) ... [2018-11-23 06:39:52,052 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca_true-termination.c.i [2018-11-23 06:39:52,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:39:52,093 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:39:52,093 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:39:52,093 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:39:52,093 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:39:52,094 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:39:52,094 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:39:52,094 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:39:52,094 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:39:52,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 06:39:52,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 06:39:52,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:39:52,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:39:52,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:39:52,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:39:52,129 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:39:52,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 06:39:52,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 06:39:52,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:39:52,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:39:52,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:39:52,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:39:52,137 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 4#L550-3true [2018-11-23 06:39:52,138 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 [2018-11-23 06:39:52,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-23 06:39:52,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:52,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:52,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:52,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:52,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:52,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2018-11-23 06:39:52,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:52,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:52,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:52,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:52,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:39:52,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:39:52,270 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:39:52,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 06:39:52,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:39:52,285 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-23 06:39:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:52,291 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-23 06:39:52,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:39:52,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-23 06:39:52,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 06:39:52,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-11-23 06:39:52,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 06:39:52,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 06:39:52,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-23 06:39:52,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:39:52,299 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 06:39:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-23 06:39:52,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 06:39:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 06:39:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 06:39:52,319 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 06:39:52,319 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 06:39:52,319 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:39:52,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 06:39:52,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 06:39:52,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:39:52,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:39:52,321 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:39:52,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:39:52,321 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 37#L550-3 [2018-11-23 06:39:52,321 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 [2018-11-23 06:39:52,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-23 06:39:52,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:52,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:52,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:52,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:52,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2018-11-23 06:39:52,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:52,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:52,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:39:52,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:52,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:39:52,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:39:52,378 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:39:52,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:39:52,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:39:52,379 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 06:39:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:52,413 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-11-23 06:39:52,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:39:52,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2018-11-23 06:39:52,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 06:39:52,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2018-11-23 06:39:52,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 06:39:52,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 06:39:52,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-23 06:39:52,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:39:52,416 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 06:39:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-23 06:39:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 06:39:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 06:39:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-23 06:39:52,417 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 06:39:52,417 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 06:39:52,417 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:39:52,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-23 06:39:52,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 06:39:52,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:39:52,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:39:52,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:39:52,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:39:52,418 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 64#L566 assume !(main_~array_size~0 < 1); 65#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 66#L550-3 [2018-11-23 06:39:52,419 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 [2018-11-23 06:39:52,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-23 06:39:52,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:52,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:52,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:52,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:52,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:52,432 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2018-11-23 06:39:52,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:52,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:52,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:39:52,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:52,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:52,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2018-11-23 06:39:52,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:52,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:52,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:52,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:52,622 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2018-11-23 06:39:52,717 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:39:52,718 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:39:52,718 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:39:52,718 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:39:52,718 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:39:52,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:39:52,718 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:39:52,718 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:39:52,718 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 06:39:52,719 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:39:52,719 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:39:52,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:52,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,192 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:39:53,196 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:39:53,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:53,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:53,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:53,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:53,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:53,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:53,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:53,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:53,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:53,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:53,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:53,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:53,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:53,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:53,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:53,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:53,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:53,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:53,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:53,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:53,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:53,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:53,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:53,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:53,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:53,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:53,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:53,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:53,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:53,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:53,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:53,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:53,291 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:39:53,334 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 06:39:53,334 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 06:39:53,336 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:39:53,338 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:39:53,338 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:39:53,339 INFO L520 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 [] [2018-11-23 06:39:53,347 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 06:39:53,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:53,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:53,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:39:53,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:39:53,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 06:39:53,447 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. [2018-11-23 06:39:53,448 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 [2018-11-23 06:39:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:39:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-23 06:39:53,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 7 letters. [2018-11-23 06:39:53,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:53,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 7 letters. [2018-11-23 06:39:53,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:53,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 14 letters. [2018-11-23 06:39:53,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:53,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-11-23 06:39:53,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:39:53,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2018-11-23 06:39:53,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 06:39:53,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 06:39:53,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-23 06:39:53,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:39:53,455 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 06:39:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-23 06:39:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 06:39:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 06:39:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-23 06:39:53,457 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-23 06:39:53,457 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-23 06:39:53,457 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:39:53,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-23 06:39:53,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:39:53,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:39:53,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:39:53,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:39:53,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:39:53,459 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 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 [2018-11-23 06:39:53,459 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 [2018-11-23 06:39:53,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:53,459 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-23 06:39:53,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:53,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:53,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:53,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:53,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:53,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:53,473 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-11-23 06:39:53,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:53,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:53,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:53,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:53,484 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-11-23 06:39:53,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:53,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:53,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:53,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:53,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:53,628 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:39:53,628 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:39:53,628 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:39:53,628 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:39:53,628 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:39:53,628 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:39:53,628 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:39:53,628 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:39:53,628 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 06:39:53,628 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:39:53,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:39:53,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:53,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,004 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:39:54,004 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:39:54,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:54,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:54,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:54,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:54,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:54,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:54,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:54,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:54,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:54,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:54,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:54,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:54,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:54,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:54,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:54,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:54,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:54,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:54,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:54,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:54,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:54,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:54,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:54,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:54,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:54,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:54,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:54,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:54,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:54,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:54,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:54,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:54,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:54,051 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:39:54,082 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-23 06:39:54,083 INFO L444 ModelExtractionUtils]: 27 out of 40 variables were initially zero. Simplification set additionally 10 variables to zero. [2018-11-23 06:39:54,083 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:39:54,084 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:39:54,084 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:39:54,084 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2018-11-23 06:39:54,108 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 06:39:54,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:54,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:54,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:54,152 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:39:54,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 06:39:54,172 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2018-11-23 06:39:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:39:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:39:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 06:39:54,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 06:39:54,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:54,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 06:39:54,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:54,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 06:39:54,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:54,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-11-23 06:39:54,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:39:54,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2018-11-23 06:39:54,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 06:39:54,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 06:39:54,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-11-23 06:39:54,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:39:54,179 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-23 06:39:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-11-23 06:39:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-11-23 06:39:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 06:39:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-23 06:39:54,180 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 06:39:54,181 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 06:39:54,181 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:39:54,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-23 06:39:54,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:39:54,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:39:54,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:39:54,182 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:39:54,182 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:39:54,182 INFO L794 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 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 [2018-11-23 06:39:54,182 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 [2018-11-23 06:39:54,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:54,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2018-11-23 06:39:54,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:54,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:54,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:54,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:39:54,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1d32384e-3af5-4c12-8a2b-7aa71dc25d87/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:39:54,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:54,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:54,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:39:54,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 06:39:54,289 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:39:54,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:54,289 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-11-23 06:39:54,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:54,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:54,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:54,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:54,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:39:54,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:39:54,342 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-23 06:39:54,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:54,380 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-11-23 06:39:54,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:39:54,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-11-23 06:39:54,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:39:54,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2018-11-23 06:39:54,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 06:39:54,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 06:39:54,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2018-11-23 06:39:54,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:39:54,383 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-23 06:39:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2018-11-23 06:39:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-11-23 06:39:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 06:39:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-23 06:39:54,384 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-23 06:39:54,385 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-23 06:39:54,385 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:39:54,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-23 06:39:54,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:39:54,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:39:54,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:39:54,386 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:39:54,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:39:54,386 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 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 [2018-11-23 06:39:54,386 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 [2018-11-23 06:39:54,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:54,386 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2018-11-23 06:39:54,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:54,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:54,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:54,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:39:54,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:54,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:54,414 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-11-23 06:39:54,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:54,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:54,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:39:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:54,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2018-11-23 06:39:54,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:39:54,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:39:54,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:54,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:39:54,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:54,752 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-11-23 06:39:54,792 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:39:54,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:39:54,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:39:54,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:39:54,792 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:39:54,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:39:54,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:39:54,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:39:54,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-23 06:39:54,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:39:54,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:39:54,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:54,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:39:55,161 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:39:55,162 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:39:55,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:55,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:55,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:55,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:55,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:55,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:55,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:55,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:55,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:55,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:55,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:55,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:55,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:55,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:55,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:55,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:55,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:55,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:55,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:55,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:55,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:55,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:55,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:55,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:55,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:55,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:55,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:55,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:55,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:55,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:39:55,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:39:55,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:39:55,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:55,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:55,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:55,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:55,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:39:55,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:39:55,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:39:55,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:39:55,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:39:55,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:39:55,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:39:55,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:39:55,230 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:39:55,249 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 06:39:55,249 INFO L444 ModelExtractionUtils]: 25 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 06:39:55,249 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:39:55,250 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:39:55,250 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:39:55,250 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2018-11-23 06:39:55,289 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 06:39:55,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:55,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:55,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:55,340 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:39:55,341 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 06:39:55,362 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 48 transitions. Complement of second has 7 states. [2018-11-23 06:39:55,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:39:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:39:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 06:39:55,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 06:39:55,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:55,365 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:39:55,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:55,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:55,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:55,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:39:55,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 06:39:55,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 48 transitions. Complement of second has 7 states. [2018-11-23 06:39:55,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:39:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:39:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 06:39:55,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 06:39:55,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:55,445 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:39:55,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:55,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:55,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:39:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:55,502 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:39:55,502 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 06:39:55,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 39 transitions. Complement of second has 6 states. [2018-11-23 06:39:55,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:39:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:39:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-23 06:39:55,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 06:39:55,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:55,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 06:39:55,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:55,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 06:39:55,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:39:55,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2018-11-23 06:39:55,523 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:39:55,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-23 06:39:55,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:39:55,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:39:55,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:39:55,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:39:55,523 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:39:55,523 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:39:55,524 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:39:55,524 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:39:55,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:39:55,524 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:39:55,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:39:55,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:39:55 BoogieIcfgContainer [2018-11-23 06:39:55,535 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:39:55,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:39:55,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:39:55,535 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:39:55,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:39:52" (3/4) ... [2018-11-23 06:39:55,539 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:39:55,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:39:55,540 INFO L168 Benchmark]: Toolchain (without parser) took 4160.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 955.4 MB in the beginning and 837.4 MB in the end (delta: 117.9 MB). Peak memory consumption was 343.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,541 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:39:55,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,542 INFO L168 Benchmark]: Boogie Preprocessor took 22.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,543 INFO L168 Benchmark]: RCFGBuilder took 236.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,543 INFO L168 Benchmark]: BuchiAutomizer took 3490.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 842.6 MB in the end (delta: 270.0 MB). Peak memory consumption was 341.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,544 INFO L168 Benchmark]: Witness Printer took 4.37 ms. Allocated memory is still 1.3 GB. Free memory was 842.6 MB in the beginning and 837.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,548 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 369.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3490.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 842.6 MB in the end (delta: 270.0 MB). Peak memory consumption was 341.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.37 ms. Allocated memory is still 1.3 GB. Free memory was 842.6 MB in the beginning and 837.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 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 -1 * j + array_size and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 85 SDtfs, 79 SDslu, 37 SDs, 0 SdLazy, 84 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital173 mio100 ax110 hnf99 lsp86 ukn76 mio100 lsp68 div100 bol100 ite100 ukn100 eq171 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 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...