./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/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 6ac1507c93933134ec25f982abf479335179fe0d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:10:21,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:10:21,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:10:21,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:10:21,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:10:21,650 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:10:21,651 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:10:21,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:10:21,653 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:10:21,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:10:21,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:10:21,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:10:21,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:10:21,656 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:10:21,657 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:10:21,657 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:10:21,658 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:10:21,659 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:10:21,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:10:21,661 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:10:21,662 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:10:21,663 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:10:21,664 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:10:21,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:10:21,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:10:21,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:10:21,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:10:21,667 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:10:21,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:10:21,668 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:10:21,668 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:10:21,669 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:10:21,669 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:10:21,669 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:10:21,670 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:10:21,671 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:10:21,671 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:10:21,682 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:10:21,682 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:10:21,683 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:10:21,683 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:10:21,683 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:10:21,683 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:10:21,683 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:10:21,683 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:10:21,684 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:10:21,684 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:10:21,684 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:10:21,684 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:10:21,684 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:10:21,684 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:10:21,684 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:10:21,684 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:10:21,684 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:10:21,684 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:10:21,684 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:10:21,685 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:10:21,686 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:10:21,686 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:10:21,686 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:10:21,686 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:10:21,686 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:10:21,686 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:10:21,686 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:10:21,686 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:10:21,687 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:10:21,687 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_d5d35626-4ecc-4031-a534-7b1b98de16e4/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 -> 6ac1507c93933134ec25f982abf479335179fe0d [2018-11-28 12:10:21,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:10:21,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:10:21,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:10:21,722 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:10:21,723 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:10:21,723 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-11-28 12:10:21,759 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/data/b93629050/5236c430e784412a9b17844a9577f4f1/FLAG970b5eea6 [2018-11-28 12:10:22,159 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:10:22,159 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-11-28 12:10:22,162 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/data/b93629050/5236c430e784412a9b17844a9577f4f1/FLAG970b5eea6 [2018-11-28 12:10:22,171 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/data/b93629050/5236c430e784412a9b17844a9577f4f1 [2018-11-28 12:10:22,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:10:22,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:10:22,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:10:22,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:10:22,177 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:10:22,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4c04a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22, skipping insertion in model container [2018-11-28 12:10:22,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:10:22,200 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:10:22,304 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:10:22,311 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:10:22,323 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:10:22,334 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:10:22,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22 WrapperNode [2018-11-28 12:10:22,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:10:22,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:10:22,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:10:22,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:10:22,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:10:22,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:10:22,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:10:22,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:10:22,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (1/1) ... [2018-11-28 12:10:22,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:10:22,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:10:22,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:10:22,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:10:22,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/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-28 12:10:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:10:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:10:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:10:22,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:10:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:10:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2018-11-28 12:10:22,466 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2018-11-28 12:10:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:10:22,644 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:10:22,644 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 12:10:22,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:10:22 BoogieIcfgContainer [2018-11-28 12:10:22,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:10:22,645 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:10:22,645 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:10:22,648 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:10:22,648 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:10:22,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:10:22" (1/3) ... [2018-11-28 12:10:22,649 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b4d014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:10:22, skipping insertion in model container [2018-11-28 12:10:22,649 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:10:22,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:10:22" (2/3) ... [2018-11-28 12:10:22,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b4d014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:10:22, skipping insertion in model container [2018-11-28 12:10:22,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:10:22,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:10:22" (3/3) ... [2018-11-28 12:10:22,651 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive_true-termination.c.i [2018-11-28 12:10:22,692 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:10:22,692 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:10:22,692 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:10:22,692 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:10:22,693 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:10:22,693 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:10:22,693 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:10:22,693 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:10:22,693 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:10:22,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 12:10:22,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 12:10:22,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:22,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:22,730 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:10:22,730 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:10:22,730 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:10:22,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 12:10:22,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 12:10:22,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:22,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:22,732 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:10:22,732 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:10:22,737 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 9#L31true assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 16#L36-3true [2018-11-28 12:10:22,737 INFO L796 eck$LassoCheckResult]: Loop: 16#L36-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 20#L36-2true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 16#L36-3true [2018-11-28 12:10:22,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:22,741 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 12:10:22,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:22,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:22,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:22,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:22,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:22,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2018-11-28 12:10:22,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:22,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:22,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:22,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2018-11-28 12:10:22,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:22,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:22,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:22,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:22,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:22,999 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:23,000 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:23,000 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:23,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:23,001 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:10:23,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:23,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:23,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:23,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-11-28 12:10:23,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:23,001 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:23,017 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-28 12:10:23,022 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-28 12:10:23,024 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-28 12:10:23,026 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-28 12:10:23,090 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-28 12:10:23,095 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-28 12:10:23,248 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:23,251 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:10:23,253 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-28 12:10:23,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:23,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:23,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:23,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:23,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:23,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:23,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:23,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:23,259 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-28 12:10:23,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:23,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:23,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:23,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:23,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:23,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:23,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:23,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:23,262 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-28 12:10:23,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:23,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:23,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:23,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:23,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:23,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:23,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:23,270 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-28 12:10:23,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:23,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:23,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:23,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:23,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:23,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:23,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:23,289 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-28 12:10:23,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:23,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:23,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:23,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:23,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:23,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:23,337 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:10:23,363 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:10:23,364 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 12:10:23,366 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:10:23,367 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:10:23,368 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:10:23,368 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 12:10:23,381 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 12:10:23,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:23,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:23,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:23,451 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-28 12:10:23,460 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-28 12:10:23,461 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2018-11-28 12:10:23,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 9 states. [2018-11-28 12:10:23,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:10:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:10:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-28 12:10:23,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 12:10:23,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:23,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 12:10:23,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:23,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 12:10:23,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:23,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2018-11-28 12:10:23,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:10:23,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2018-11-28 12:10:23,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 12:10:23,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 12:10:23,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-28 12:10:23,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:10:23,508 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 12:10:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-28 12:10:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 12:10:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 12:10:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-28 12:10:23,525 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 12:10:23,525 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 12:10:23,526 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:10:23,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-28 12:10:23,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:10:23,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:23,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:23,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:10:23,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:10:23,527 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 122#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 120#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 121#L36-3 assume !(main_~i~0 < main_~n~0); 115#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 118#selectionSortENTRY [2018-11-28 12:10:23,527 INFO L796 eck$LassoCheckResult]: Loop: 118#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 119#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 123#L14-3 assume !(~index~0 < ~size); 124#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 116#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 118#selectionSortENTRY [2018-11-28 12:10:23,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:23,527 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2018-11-28 12:10:23,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:23,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:23,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:23,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:23,568 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-28 12:10:23,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:23,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:10:23,570 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:10:23,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:23,570 INFO L82 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2018-11-28 12:10:23,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:23,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:23,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:23,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:23,584 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-28 12:10:23,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:23,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:10:23,585 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:10:23,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:10:23,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:10:23,588 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 12:10:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:23,597 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-28 12:10:23,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:10:23,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 12:10:23,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:10:23,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 12:10:23,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 12:10:23,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:10:23,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-28 12:10:23,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:10:23,600 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 12:10:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-28 12:10:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 12:10:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 12:10:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 12:10:23,601 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 12:10:23,601 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 12:10:23,601 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:10:23,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 12:10:23,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:10:23,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:23,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:23,602 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:10:23,602 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:23,602 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 156#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 157#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 158#L36-3 assume !(main_~i~0 < main_~n~0); 152#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 154#selectionSortENTRY [2018-11-28 12:10:23,603 INFO L796 eck$LassoCheckResult]: Loop: 154#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 155#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 159#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 150#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 153#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 162#L14-3 assume !(~index~0 < ~size); 160#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 151#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 154#selectionSortENTRY [2018-11-28 12:10:23,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:23,603 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2018-11-28 12:10:23,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:23,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:23,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:23,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:23,628 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-28 12:10:23,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:10:23,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:10:23,628 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:10:23,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2018-11-28 12:10:23,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:23,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:23,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:23,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:23,785 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 12:10:23,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:10:23,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:10:23,898 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 12:10:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:23,904 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-28 12:10:23,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:10:23,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-28 12:10:23,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:10:23,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 12:10:23,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 12:10:23,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:10:23,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 12:10:23,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:10:23,907 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 12:10:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 12:10:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 12:10:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 12:10:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 12:10:23,909 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 12:10:23,909 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 12:10:23,909 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:10:23,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 12:10:23,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:10:23,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:23,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:23,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:23,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:23,911 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 194#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 195#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 200#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 201#L36-3 assume !(main_~i~0 < main_~n~0); 188#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 191#selectionSortENTRY [2018-11-28 12:10:23,911 INFO L796 eck$LassoCheckResult]: Loop: 191#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 192#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 196#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 187#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 190#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 199#L14-3 assume !(~index~0 < ~size); 197#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 189#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 191#selectionSortENTRY [2018-11-28 12:10:23,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2018-11-28 12:10:23,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:23,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:23,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2018-11-28 12:10:23,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:23,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:23,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:23,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:23,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:23,940 INFO L82 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2018-11-28 12:10:23,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:23,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:10:24,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:10:24,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/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-28 12:10:24,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:24,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:10:24,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:10:24,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 12:10:24,208 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 12:10:24,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:10:24,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:10:24,316 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-28 12:10:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:24,367 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-28 12:10:24,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:10:24,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-28 12:10:24,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:10:24,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2018-11-28 12:10:24,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 12:10:24,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:10:24,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 12:10:24,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:10:24,369 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 12:10:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 12:10:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-28 12:10:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 12:10:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-28 12:10:24,371 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 12:10:24,371 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 12:10:24,374 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:10:24,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-28 12:10:24,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:10:24,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:24,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:24,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-28 12:10:24,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:24,376 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 290#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 291#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 292#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 297#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 298#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 299#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 300#L36-3 assume !(main_~i~0 < main_~n~0); 285#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 288#selectionSortENTRY [2018-11-28 12:10:24,376 INFO L796 eck$LassoCheckResult]: Loop: 288#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 289#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 293#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 284#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 287#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 296#L14-3 assume !(~index~0 < ~size); 294#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 286#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 288#selectionSortENTRY [2018-11-28 12:10:24,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2018-11-28 12:10:24,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:24,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:24,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:24,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2018-11-28 12:10:24,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:24,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:24,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:24,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:24,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:24,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:24,403 INFO L82 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2018-11-28 12:10:24,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:24,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:24,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:24,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:24,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:24,567 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 12:10:24,866 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:24,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:24,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:24,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:24,866 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:10:24,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:24,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:24,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:24,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration5_Lasso [2018-11-28 12:10:24,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:24,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:24,872 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-28 12:10:24,873 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-28 12:10:24,875 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-28 12:10:24,876 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-28 12:10:24,877 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-28 12:10:24,877 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-28 12:10:24,878 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-28 12:10:24,880 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-28 12:10:24,881 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-28 12:10:24,881 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-28 12:10:24,883 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-28 12:10:24,884 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-28 12:10:24,884 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-28 12:10:24,885 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-28 12:10:24,886 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-28 12:10:24,887 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-28 12:10:24,888 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-28 12:10:24,889 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-28 12:10:24,890 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-28 12:10:24,949 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-28 12:10:24,950 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-28 12:10:24,951 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-28 12:10:24,952 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-28 12:10:24,954 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-28 12:10:24,956 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-28 12:10:24,957 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-28 12:10:24,959 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-28 12:10:24,960 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-28 12:10:24,963 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-28 12:10:24,964 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-28 12:10:25,093 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:25,093 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:10:25,093 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-28 12:10:25,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,096 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-28 12:10:25,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:25,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:25,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,099 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-28 12:10:25,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,101 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-28 12:10:25,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,107 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-28 12:10:25,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,109 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-28 12:10:25,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,110 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-28 12:10:25,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,112 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-28 12:10:25,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,114 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-28 12:10:25,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,116 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-28 12:10:25,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,118 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-28 12:10:25,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,119 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-28 12:10:25,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,121 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-28 12:10:25,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,122 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-28 12:10:25,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,124 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-28 12:10:25,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,126 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-28 12:10:25,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:25,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:25,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,129 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-28 12:10:25,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,131 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-28 12:10:25,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:25,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:25,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:25,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,132 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-28 12:10:25,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:25,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:25,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:25,139 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-28 12:10:25,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:25,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:25,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:25,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:25,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:25,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:25,160 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:10:25,177 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:10:25,177 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 12:10:25,177 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:10:25,178 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:10:25,179 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:10:25,179 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_#in~startIndex, v_rep(select #length selectionSort_#in~array.base)_1, selectionSort_#in~array.offset) = -4*selectionSort_#in~startIndex + 1*v_rep(select #length selectionSort_#in~array.base)_1 - 1*selectionSort_#in~array.offset Supporting invariants [] [2018-11-28 12:10:25,188 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 12:10:25,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:10:25,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:25,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:25,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:10:25,289 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 12:10:25,289 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 12:10:25,396 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 39 states and 48 transitions. Complement of second has 15 states. [2018-11-28 12:10:25,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:10:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:10:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-28 12:10:25,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 8 letters. [2018-11-28 12:10:25,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:25,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 17 letters. Loop has 8 letters. [2018-11-28 12:10:25,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:25,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 16 letters. [2018-11-28 12:10:25,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:25,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2018-11-28 12:10:25,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 12:10:25,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 44 transitions. [2018-11-28 12:10:25,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 12:10:25,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 12:10:25,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-11-28 12:10:25,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:25,405 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-28 12:10:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-11-28 12:10:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-11-28 12:10:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 12:10:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-28 12:10:25,407 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-28 12:10:25,407 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-28 12:10:25,407 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:10:25,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-11-28 12:10:25,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:10:25,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:25,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:25,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:25,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:10:25,409 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 447#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 448#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 449#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 455#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 456#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 457#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 458#L36-3 assume !(main_~i~0 < main_~n~0); 438#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 443#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 445#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 450#L14-3 [2018-11-28 12:10:25,409 INFO L796 eck$LassoCheckResult]: Loop: 450#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 437#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 439#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 450#L14-3 [2018-11-28 12:10:25,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:25,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1305603789, now seen corresponding path program 1 times [2018-11-28 12:10:25,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:25,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:25,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:25,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:25,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:25,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 1 times [2018-11-28 12:10:25,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:25,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:25,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:25,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:25,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:25,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash -18607689, now seen corresponding path program 1 times [2018-11-28 12:10:25,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:25,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:25,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:25,607 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 12:10:25,759 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:25,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:25,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:25,759 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:25,759 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:10:25,759 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:25,759 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:25,759 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:25,760 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration6_Lasso [2018-11-28 12:10:25,760 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:25,760 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:25,762 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-28 12:10:25,775 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-28 12:10:25,776 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-28 12:10:25,778 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-28 12:10:25,780 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-28 12:10:25,781 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-28 12:10:25,783 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-28 12:10:25,784 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-28 12:10:25,785 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-28 12:10:25,786 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-28 12:10:25,787 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-28 12:10:25,788 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-28 12:10:25,789 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-28 12:10:25,790 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-28 12:10:25,791 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-28 12:10:25,792 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-28 12:10:25,883 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-28 12:10:25,884 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-28 12:10:25,885 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-28 12:10:25,885 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-28 12:10:25,886 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-28 12:10:26,039 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:26,039 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:10:26,039 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-28 12:10:26,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,041 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-28 12:10:26,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,049 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-28 12:10:26,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,051 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-28 12:10:26,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:26,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:26,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,055 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-28 12:10:26,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,056 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-28 12:10:26,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,058 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-28 12:10:26,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,060 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-28 12:10:26,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:26,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:26,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,062 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-28 12:10:26,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,064 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-28 12:10:26,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,066 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-28 12:10:26,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,067 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-28 12:10:26,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,069 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-28 12:10:26,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,071 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-28 12:10:26,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:26,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:26,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:26,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:26,072 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-28 12:10:26,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:26,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:26,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:26,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:26,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:26,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:26,092 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:10:26,109 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:10:26,109 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 12:10:26,109 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:10:26,111 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:10:26,112 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:10:26,112 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~array.offset, v_rep(select #length selectionSort_~array.base)_1) = -4*selectionSort_~index~0 - 1*selectionSort_~array.offset + 1*v_rep(select #length selectionSort_~array.base)_1 Supporting invariants [] [2018-11-28 12:10:26,146 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 12:10:26,147 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:10:26,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:26,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:26,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:26,188 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-28 12:10:26,188 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-28 12:10:26,188 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 12:10:26,202 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 53 transitions. Complement of second has 8 states. [2018-11-28 12:10:26,203 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-28 12:10:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:10:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 12:10:26,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 12:10:26,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:26,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 12:10:26,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:26,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 12:10:26,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:26,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2018-11-28 12:10:26,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:10:26,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 36 transitions. [2018-11-28 12:10:26,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 12:10:26,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 12:10:26,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2018-11-28 12:10:26,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:26,206 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-28 12:10:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2018-11-28 12:10:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-11-28 12:10:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 12:10:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-28 12:10:26,208 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 12:10:26,208 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 12:10:26,208 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:10:26,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-28 12:10:26,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:10:26,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:26,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:26,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:26,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:10:26,209 INFO L794 eck$LassoCheckResult]: Stem: 598#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 592#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 593#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 594#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 600#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 601#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 602#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 603#L36-3 assume !(main_~i~0 < main_~n~0); 586#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 588#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 589#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 596#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 585#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 587#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 599#L14-3 assume !(~index~0 < ~size); 597#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 583#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 590#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 591#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 595#L14-3 [2018-11-28 12:10:26,209 INFO L796 eck$LassoCheckResult]: Loop: 595#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 582#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 584#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 595#L14-3 [2018-11-28 12:10:26,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:26,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1445216632, now seen corresponding path program 1 times [2018-11-28 12:10:26,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:26,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:26,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 12:10:26,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:10:26,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d5d35626-4ecc-4031-a534-7b1b98de16e4/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:10:26,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:26,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:10:26,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:10:26,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-11-28 12:10:26,370 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:10:26,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 2 times [2018-11-28 12:10:26,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:26,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:26,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:26,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:10:26,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:26,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 12:10:26,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:10:26,405 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 15 states. [2018-11-28 12:10:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:10:26,562 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-28 12:10:26,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 12:10:26,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2018-11-28 12:10:26,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:10:26,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 45 transitions. [2018-11-28 12:10:26,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 12:10:26,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 12:10:26,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-11-28 12:10:26,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:10:26,568 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-28 12:10:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-11-28 12:10:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-28 12:10:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 12:10:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-28 12:10:26,572 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 12:10:26,572 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 12:10:26,572 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:10:26,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-28 12:10:26,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:10:26,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:10:26,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:10:26,575 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:10:26,575 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:10:26,575 INFO L794 eck$LassoCheckResult]: Stem: 760#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 753#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 754#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 755#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 762#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 769#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 765#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 763#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 764#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 766#L36-3 assume !(main_~i~0 < main_~n~0); 747#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 749#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 750#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 758#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 768#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 761#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 757#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 746#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 748#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 767#L14-3 assume !(~index~0 < ~size); 759#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 744#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 751#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 752#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 756#L14-3 [2018-11-28 12:10:26,575 INFO L796 eck$LassoCheckResult]: Loop: 756#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 743#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 745#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 756#L14-3 [2018-11-28 12:10:26,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash 349648920, now seen corresponding path program 2 times [2018-11-28 12:10:26,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:26,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:26,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:26,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:26,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:26,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 3 times [2018-11-28 12:10:26,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:26,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:26,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:26,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:26,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:26,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1095320754, now seen corresponding path program 1 times [2018-11-28 12:10:26,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:10:26,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:10:26,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:26,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:10:26,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:10:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:10:26,826 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-28 12:10:27,162 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-28 12:10:27,399 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2018-11-28 12:10:27,435 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:10:27,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:10:27,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:10:27,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:10:27,435 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:10:27,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:10:27,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:10:27,435 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:10:27,435 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-11-28 12:10:27,435 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:10:27,435 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:10:27,437 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-28 12:10:27,439 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-28 12:10:27,440 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-28 12:10:27,441 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-28 12:10:27,443 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-28 12:10:27,444 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-28 12:10:27,446 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-28 12:10:27,447 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-28 12:10:27,448 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-28 12:10:27,449 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-28 12:10:27,450 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-28 12:10:27,451 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-28 12:10:27,452 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-28 12:10:27,453 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-28 12:10:27,454 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-28 12:10:27,454 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-28 12:10:27,455 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-28 12:10:27,456 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-28 12:10:27,457 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-28 12:10:27,458 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-28 12:10:27,458 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-28 12:10:27,559 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-28 12:10:27,560 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-28 12:10:27,561 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-28 12:10:27,717 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:10:27,717 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:10:27,718 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-28 12:10:27,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:27,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:27,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,720 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-28 12:10:27,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,722 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-28 12:10:27,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,723 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-28 12:10:27,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,725 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-28 12:10:27,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,726 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-28 12:10:27,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,727 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-28 12:10:27,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,728 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-28 12:10:27,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,729 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-28 12:10:27,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,730 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-28 12:10:27,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,731 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-28 12:10:27,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:27,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:27,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,733 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-28 12:10:27,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,735 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-28 12:10:27,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,736 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-28 12:10:27,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,738 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-28 12:10:27,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,739 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-28 12:10:27,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,741 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-28 12:10:27,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,742 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-28 12:10:27,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,744 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-28 12:10:27,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,744 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:10:27,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,745 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:10:27,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:27,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,748 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-28 12:10:27,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,750 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-28 12:10:27,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:27,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:27,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,765 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-28 12:10:27,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:27,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:27,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,768 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-28 12:10:27,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:10:27,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:10:27,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:10:27,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:10:27,769 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-28 12:10:27,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:10:27,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:10:27,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:10:27,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:10:27,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:10:27,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:10:27,791 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:10:27,807 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 12:10:27,808 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 12:10:27,808 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:10:27,809 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:10:27,809 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:10:27,809 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~array.offset, v_rep(select #length selectionSort_~array.base)_2) = -4*selectionSort_~index~0 - 1*selectionSort_~array.offset + 1*v_rep(select #length selectionSort_~array.base)_2 Supporting invariants [] [2018-11-28 12:10:27,836 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 12:10:27,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:10:27,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:27,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:27,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:27,883 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-28 12:10:27,883 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-28 12:10:27,883 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 12:10:27,899 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-11-28 12:10:27,899 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-28 12:10:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:10:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 12:10:27,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-28 12:10:27,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:27,900 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:10:27,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:27,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:27,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:27,940 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-28 12:10:27,940 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-28 12:10:27,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 12:10:27,958 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-11-28 12:10:27,960 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-28 12:10:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:10:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 12:10:27,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-28 12:10:27,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:27,961 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:10:27,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:10:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:27,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:10:28,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:10:28,017 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-28 12:10:28,017 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-28 12:10:28,017 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 12:10:28,030 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 47 transitions. Complement of second has 7 states. [2018-11-28 12:10:28,030 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-28 12:10:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:10:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-28 12:10:28,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-28 12:10:28,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:28,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2018-11-28 12:10:28,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:28,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2018-11-28 12:10:28,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:10:28,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2018-11-28 12:10:28,032 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:10:28,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-28 12:10:28,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:10:28,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:10:28,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:10:28,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:10:28,033 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:10:28,033 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:10:28,033 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:10:28,033 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 12:10:28,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:10:28,033 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:10:28,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:10:28,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:10:28 BoogieIcfgContainer [2018-11-28 12:10:28,039 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:10:28,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:10:28,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:10:28,039 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:10:28,040 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:10:22" (3/4) ... [2018-11-28 12:10:28,043 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:10:28,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:10:28,043 INFO L168 Benchmark]: Toolchain (without parser) took 5870.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:10:28,044 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:10:28,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.73 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:10:28,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:10:28,045 INFO L168 Benchmark]: Boogie Preprocessor took 15.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:10:28,045 INFO L168 Benchmark]: RCFGBuilder took 224.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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:10:28,045 INFO L168 Benchmark]: BuchiAutomizer took 5394.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 95.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.1 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:10:28,046 INFO L168 Benchmark]: Witness Printer took 3.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:10:28,048 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.73 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 224.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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5394.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 95.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.1 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -4 * \old(startIndex) + unknown-#length-unknown[array] + -1 * array and consists of 5 locations. One deterministic module has affine ranking function -4 * index + -1 * array + unknown-#length-unknown[array] and consists of 4 locations. One nondeterministic module has affine ranking function -4 * index + -1 * array + unknown-#length-unknown[array] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 112 SDtfs, 139 SDslu, 116 SDs, 0 SdLazy, 265 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital171 mio100 ax100 hnf99 lsp96 ukn69 mio100 lsp66 div100 bol100 ite100 ukn100 eq161 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...