./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/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_40abc469-daf3-4698-b6fa-915f3caabbc1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/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-5842f4b [2018-11-18 16:23:29,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:23:29,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:23:29,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:23:29,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:23:29,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:23:29,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:23:29,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:23:29,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:23:29,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:23:29,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:23:29,456 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:23:29,457 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:23:29,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:23:29,458 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:23:29,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:23:29,459 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:23:29,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:23:29,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:23:29,463 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:23:29,464 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:23:29,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:23:29,466 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:23:29,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:23:29,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:23:29,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:23:29,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:23:29,468 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:23:29,469 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:23:29,469 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:23:29,470 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:23:29,470 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:23:29,470 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:23:29,470 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:23:29,471 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:23:29,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:23:29,472 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 16:23:29,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:23:29,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:23:29,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:23:29,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:23:29,483 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:23:29,484 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:23:29,484 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:23:29,484 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:23:29,484 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:23:29,484 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:23:29,484 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:23:29,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:23:29,485 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:23:29,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:23:29,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:23:29,485 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:23:29,485 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:23:29,485 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:23:29,485 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:23:29,486 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:23:29,486 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:23:29,486 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:23:29,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:23:29,486 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:23:29,486 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:23:29,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:23:29,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:23:29,487 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:23:29,487 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:23:29,488 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_40abc469-daf3-4698-b6fa-915f3caabbc1/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-18 16:23:29,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:23:29,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:23:29,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:23:29,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:23:29,523 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:23:29,524 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-11-18 16:23:29,565 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/bin-2019/uautomizer/data/82b6b7d68/d5155db4cb0845e59feaed71c63be0a3/FLAG1cde04194 [2018-11-18 16:23:29,973 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:23:29,973 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-11-18 16:23:29,977 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/bin-2019/uautomizer/data/82b6b7d68/d5155db4cb0845e59feaed71c63be0a3/FLAG1cde04194 [2018-11-18 16:23:29,988 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/bin-2019/uautomizer/data/82b6b7d68/d5155db4cb0845e59feaed71c63be0a3 [2018-11-18 16:23:29,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:23:29,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:23:29,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:23:29,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:23:29,993 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:23:29,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:23:29" (1/1) ... [2018-11-18 16:23:29,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d8cffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:29, skipping insertion in model container [2018-11-18 16:23:29,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:23:29" (1/1) ... [2018-11-18 16:23:30,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:23:30,014 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:23:30,119 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:23:30,126 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:23:30,136 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:23:30,145 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:23:30,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30 WrapperNode [2018-11-18 16:23:30,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:23:30,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:23:30,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:23:30,146 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:23:30,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (1/1) ... [2018-11-18 16:23:30,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (1/1) ... [2018-11-18 16:23:30,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:23:30,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:23:30,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:23:30,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:23:30,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (1/1) ... [2018-11-18 16:23:30,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (1/1) ... [2018-11-18 16:23:30,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (1/1) ... [2018-11-18 16:23:30,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (1/1) ... [2018-11-18 16:23:30,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (1/1) ... [2018-11-18 16:23:30,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (1/1) ... [2018-11-18 16:23:30,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (1/1) ... [2018-11-18 16:23:30,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:23:30,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:23:30,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:23:30,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:23:30,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/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-18 16:23:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:23:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:23:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:23:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:23:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:23:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2018-11-18 16:23:30,250 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2018-11-18 16:23:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:23:30,384 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:23:30,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:23:30 BoogieIcfgContainer [2018-11-18 16:23:30,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:23:30,385 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:23:30,385 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:23:30,387 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:23:30,387 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:23:30,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:23:29" (1/3) ... [2018-11-18 16:23:30,388 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6201b26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:23:30, skipping insertion in model container [2018-11-18 16:23:30,388 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:23:30,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:23:30" (2/3) ... [2018-11-18 16:23:30,388 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6201b26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:23:30, skipping insertion in model container [2018-11-18 16:23:30,388 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:23:30,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:23:30" (3/3) ... [2018-11-18 16:23:30,389 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive_true-termination.c.i [2018-11-18 16:23:30,422 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:23:30,423 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:23:30,423 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:23:30,423 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:23:30,423 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:23:30,423 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:23:30,423 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:23:30,423 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:23:30,423 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:23:30,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-18 16:23:30,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 16:23:30,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:23:30,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:23:30,456 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 16:23:30,456 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:23:30,456 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:23:30,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-18 16:23:30,458 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 16:23:30,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:23:30,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:23:30,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 16:23:30,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:23:30,464 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 10#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-4true [2018-11-18 16:23:30,464 INFO L796 eck$LassoCheckResult]: Loop: 16#L36-4true assume true; 22#L36-1true 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; 17#L36-3true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 16#L36-4true [2018-11-18 16:23:30,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:30,468 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-18 16:23:30,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:30,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:30,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:30,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:30,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:30,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:30,540 INFO L82 PathProgramCache]: Analyzing trace with hash 40876, now seen corresponding path program 1 times [2018-11-18 16:23:30,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:30,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:30,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:30,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:30,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:30,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:30,555 INFO L82 PathProgramCache]: Analyzing trace with hash 889570345, now seen corresponding path program 1 times [2018-11-18 16:23:30,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:30,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:30,719 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:23:30,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:23:30,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:23:30,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:23:30,720 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:23:30,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:23:30,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:23:30,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:23:30,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-11-18 16:23:30,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:23:30,721 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:23:30,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:23:30,829 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-18 16:23:30,831 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-18 16:23:30,835 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-18 16:23:30,838 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-18 16:23:30,841 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-18 16:23:31,024 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:23:31,029 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:23:31,031 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-18 16:23:31,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:31,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:31,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:31,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:31,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:31,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:31,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:31,054 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-18 16:23:31,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:31,055 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:23:31,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:31,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:31,058 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:23:31,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:31,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:31,070 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-18 16:23:31,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:31,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:31,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:31,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:31,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:31,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:31,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:31,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:31,073 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-18 16:23:31,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:31,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:31,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:31,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:31,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:31,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:31,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:31,080 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-18 16:23:31,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:31,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:31,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:31,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:31,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:31,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:31,117 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:23:31,151 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 16:23:31,152 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 16:23:31,153 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:23:31,155 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 16:23:31,155 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:23:31,156 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~a~0.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~a~0.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*ULTIMATE.start_main_~a~0.offset >= 0] [2018-11-18 16:23:31,175 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 16:23:31,196 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:23:31,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:31,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:31,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:31,251 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-18 16:23:31,262 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-18 16:23:31,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 4 states. [2018-11-18 16:23:31,304 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 4 states. Result 43 states and 55 transitions. Complement of second has 9 states. [2018-11-18 16:23:31,305 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-18 16:23:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:23:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-18 16:23:31,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-18 16:23:31,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:31,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 16:23:31,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:31,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-18 16:23:31,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:31,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2018-11-18 16:23:31,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 16:23:31,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 17 states and 22 transitions. [2018-11-18 16:23:31,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 16:23:31,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 16:23:31,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-18 16:23:31,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:23:31,319 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 16:23:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-18 16:23:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 16:23:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 16:23:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-18 16:23:31,336 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 16:23:31,336 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 16:23:31,336 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:23:31,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-11-18 16:23:31,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 16:23:31,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:23:31,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:23:31,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:23:31,337 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:23:31,338 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 141#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; 142#L36-4 assume true; 145#L36-1 assume !(main_~i~0 < main_~n~0); 134#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 136#selectionSortENTRY [2018-11-18 16:23:31,338 INFO L796 eck$LassoCheckResult]: Loop: 136#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 137#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 143#L14-4 assume !true; 139#L14-5 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); 133#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 136#selectionSortENTRY [2018-11-18 16:23:31,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:31,338 INFO L82 PathProgramCache]: Analyzing trace with hash 889570319, now seen corresponding path program 1 times [2018-11-18 16:23:31,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:31,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:31,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:31,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:31,363 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-18 16:23:31,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:23:31,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:23:31,366 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 16:23:31,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash 54536465, now seen corresponding path program 1 times [2018-11-18 16:23:31,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:31,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:31,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:31,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:31,371 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-18 16:23:31,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:23:31,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:23:31,371 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:23:31,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:23:31,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:23:31,374 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 2 states. [2018-11-18 16:23:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:23:31,377 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-18 16:23:31,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:23:31,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-18 16:23:31,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 16:23:31,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 16:23:31,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 16:23:31,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 16:23:31,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-11-18 16:23:31,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:23:31,379 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 16:23:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-11-18 16:23:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 16:23:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 16:23:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 16:23:31,381 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 16:23:31,381 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 16:23:31,381 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:23:31,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-18 16:23:31,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 16:23:31,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:23:31,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:23:31,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:23:31,382 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:23:31,382 INFO L794 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 181#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; 182#L36-4 assume true; 185#L36-1 assume !(main_~i~0 < main_~n~0); 173#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 176#selectionSortENTRY [2018-11-18 16:23:31,383 INFO L796 eck$LassoCheckResult]: Loop: 176#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 177#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 183#L14-4 assume true; 178#L14-1 assume !(~index~0 < ~size); 179#L14-5 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); 174#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 176#selectionSortENTRY [2018-11-18 16:23:31,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash 889570319, now seen corresponding path program 2 times [2018-11-18 16:23:31,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:31,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:31,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:31,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:31,405 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-18 16:23:31,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:23:31,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:23:31,405 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 16:23:31,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1690200749, now seen corresponding path program 1 times [2018-11-18 16:23:31,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:31,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:31,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:23:31,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:31,432 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-18 16:23:31,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:23:31,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:23:31,433 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:23:31,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:23:31,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:23:31,433 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 16:23:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:23:31,445 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-11-18 16:23:31,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:23:31,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-11-18 16:23:31,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 16:23:31,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2018-11-18 16:23:31,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 16:23:31,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 16:23:31,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-18 16:23:31,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:23:31,447 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 16:23:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-18 16:23:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 16:23:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 16:23:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-18 16:23:31,449 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 16:23:31,449 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 16:23:31,449 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:23:31,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-18 16:23:31,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 16:23:31,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:23:31,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:23:31,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:23:31,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:23:31,450 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 223#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; 224#L36-4 assume true; 229#L36-1 assume !(main_~i~0 < main_~n~0); 217#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 219#selectionSortENTRY [2018-11-18 16:23:31,450 INFO L796 eck$LassoCheckResult]: Loop: 219#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 220#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 225#L14-4 assume true; 221#L14-1 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); 215#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 218#L14-3 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 226#L14-4 assume true; 233#L14-1 assume !(~index~0 < ~size); 232#L14-5 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); 216#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 219#selectionSortENTRY [2018-11-18 16:23:31,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash 889570319, now seen corresponding path program 3 times [2018-11-18 16:23:31,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:31,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:31,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:31,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:31,469 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-18 16:23:31,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:23:31,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:23:31,469 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 16:23:31,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash 280406070, now seen corresponding path program 1 times [2018-11-18 16:23:31,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:31,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:23:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:31,651 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-18 16:23:31,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:23:31,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:23:31,760 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 16:23:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:23:31,769 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-18 16:23:31,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:23:31,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-11-18 16:23:31,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 16:23:31,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 24 transitions. [2018-11-18 16:23:31,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 16:23:31,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 16:23:31,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-18 16:23:31,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:23:31,771 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-18 16:23:31,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-18 16:23:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-18 16:23:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 16:23:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-18 16:23:31,773 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 16:23:31,773 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 16:23:31,773 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 16:23:31,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-18 16:23:31,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 16:23:31,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:23:31,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:23:31,774 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:23:31,774 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:23:31,775 INFO L794 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 269#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 270#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; 271#L36-4 assume true; 276#L36-1 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; 279#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 277#L36-4 assume true; 278#L36-1 assume !(main_~i~0 < main_~n~0); 264#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 266#selectionSortENTRY [2018-11-18 16:23:31,775 INFO L796 eck$LassoCheckResult]: Loop: 266#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 267#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 273#L14-4 assume true; 268#L14-1 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); 262#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 265#L14-3 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 272#L14-4 assume true; 274#L14-1 assume !(~index~0 < ~size); 280#L14-5 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); 263#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 266#selectionSortENTRY [2018-11-18 16:23:31,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:31,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1241942634, now seen corresponding path program 1 times [2018-11-18 16:23:31,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:31,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:31,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:31,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:31,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:31,786 INFO L82 PathProgramCache]: Analyzing trace with hash 280406070, now seen corresponding path program 2 times [2018-11-18 16:23:31,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:31,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:31,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:31,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:31,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1701184351, now seen corresponding path program 1 times [2018-11-18 16:23:31,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:31,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:31,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:23:31,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:23:31,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:23:31,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/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-18 16:23:31,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:31,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:23:31,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:23:31,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-18 16:23:32,073 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-18 16:23:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:23:32,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:23:32,173 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-18 16:23:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:23:32,225 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-18 16:23:32,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:23:32,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-11-18 16:23:32,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 16:23:32,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 27 transitions. [2018-11-18 16:23:32,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 16:23:32,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 16:23:32,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-18 16:23:32,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:23:32,228 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-18 16:23:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-18 16:23:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-18 16:23:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 16:23:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-18 16:23:32,229 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 16:23:32,230 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 16:23:32,230 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 16:23:32,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-18 16:23:32,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 16:23:32,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:23:32,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:23:32,231 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 16:23:32,231 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:23:32,231 INFO L794 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 389#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; 390#L36-4 assume true; 394#L36-1 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; 398#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 395#L36-4 assume true; 396#L36-1 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; 400#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 403#L36-4 assume true; 399#L36-1 assume !(main_~i~0 < main_~n~0); 384#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 386#selectionSortENTRY [2018-11-18 16:23:32,231 INFO L796 eck$LassoCheckResult]: Loop: 386#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 387#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 392#L14-4 assume true; 388#L14-1 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); 382#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 385#L14-3 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 393#L14-4 assume true; 402#L14-1 assume !(~index~0 < ~size); 401#L14-5 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); 383#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 386#selectionSortENTRY [2018-11-18 16:23:32,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:32,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1865507375, now seen corresponding path program 2 times [2018-11-18 16:23:32,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:32,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:32,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:32,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:32,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:32,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:32,243 INFO L82 PathProgramCache]: Analyzing trace with hash 280406070, now seen corresponding path program 3 times [2018-11-18 16:23:32,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:32,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:32,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:32,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:23:32,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:32,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1143843044, now seen corresponding path program 2 times [2018-11-18 16:23:32,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:32,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:32,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:23:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:32,393 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-18 16:23:32,595 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2018-11-18 16:23:32,674 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:23:32,674 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:23:32,674 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:23:32,674 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:23:32,674 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:23:32,674 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:23:32,674 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:23:32,674 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:23:32,674 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration6_Lasso [2018-11-18 16:23:32,674 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:23:32,674 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:23:32,677 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-18 16:23:32,680 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-18 16:23:32,681 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-18 16:23:32,683 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-18 16:23:32,684 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-18 16:23:32,685 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-18 16:23:32,688 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-18 16:23:32,695 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-18 16:23:32,696 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-18 16:23:32,697 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-18 16:23:32,698 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-18 16:23:32,699 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-18 16:23:32,700 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-18 16:23:32,701 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-18 16:23:32,701 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-18 16:23:32,702 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-18 16:23:32,703 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-18 16:23:32,704 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-18 16:23:32,705 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-18 16:23:32,706 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-18 16:23:32,773 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-18 16:23:32,774 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-18 16:23:32,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-18 16:23:32,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-18 16:23:32,777 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-18 16:23:32,779 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-18 16:23:32,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-18 16:23:32,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-18 16:23:32,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-18 16:23:32,782 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-18 16:23:32,904 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:23:32,904 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:23:32,905 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-18 16:23:32,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,907 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-18 16:23:32,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:32,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:32,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,910 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-18 16:23:32,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,912 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-18 16:23:32,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,914 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-18 16:23:32,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,916 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-18 16:23:32,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,918 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-18 16:23:32,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,920 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-18 16:23:32,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,922 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-18 16:23:32,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,924 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-18 16:23:32,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,928 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-18 16:23:32,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,930 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-18 16:23:32,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,932 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-18 16:23:32,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,933 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-18 16:23:32,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,935 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-18 16:23:32,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,937 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-18 16:23:32,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,939 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-18 16:23:32,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:32,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:32,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,942 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-18 16:23:32,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,943 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-18 16:23:32,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:32,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:32,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:32,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,945 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-18 16:23:32,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:32,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:32,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:32,953 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-18 16:23:32,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:32,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:32,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:32,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:32,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:32,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:32,981 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:23:32,994 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 16:23:32,994 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-18 16:23:32,994 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:23:32,995 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:23:32,995 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:23:32,996 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-18 16:23:33,025 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-18 16:23:33,027 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:23:33,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:33,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:33,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:23:33,141 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-18 16:23:33,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 16:23:33,227 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2018-11-18 16:23:33,228 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-18 16:23:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 16:23:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-18 16:23:33,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 16:23:33,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:33,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-18 16:23:33,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:33,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-18 16:23:33,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:33,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 59 transitions. [2018-11-18 16:23:33,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 16:23:33,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 46 states and 55 transitions. [2018-11-18 16:23:33,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 16:23:33,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 16:23:33,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 55 transitions. [2018-11-18 16:23:33,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:23:33,232 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-18 16:23:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 55 transitions. [2018-11-18 16:23:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2018-11-18 16:23:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 16:23:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-18 16:23:33,234 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-18 16:23:33,234 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-18 16:23:33,234 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 16:23:33,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2018-11-18 16:23:33,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:23:33,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:23:33,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:23:33,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:23:33,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:23:33,236 INFO L794 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 578#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 579#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; 580#L36-4 assume true; 585#L36-1 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; 592#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 586#L36-4 assume true; 587#L36-1 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; 588#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 589#L36-4 assume true; 590#L36-1 assume !(main_~i~0 < main_~n~0); 567#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 572#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 574#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 581#L14-4 [2018-11-18 16:23:33,236 INFO L796 eck$LassoCheckResult]: Loop: 581#L14-4 assume true; 576#L14-1 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); 566#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 568#L14-3 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 581#L14-4 [2018-11-18 16:23:33,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1751225811, now seen corresponding path program 1 times [2018-11-18 16:23:33,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:33,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:33,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:23:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:33,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:33,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2006026, now seen corresponding path program 1 times [2018-11-18 16:23:33,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:33,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:33,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:33,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:33,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:33,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:33,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1891829540, now seen corresponding path program 1 times [2018-11-18 16:23:33,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:33,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:33,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:33,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:33,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:33,584 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:23:33,584 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:23:33,585 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:23:33,585 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:23:33,585 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:23:33,585 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:23:33,585 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:23:33,585 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:23:33,585 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration7_Lasso [2018-11-18 16:23:33,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:23:33,585 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:23:33,587 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-18 16:23:33,592 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-18 16:23:33,594 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-18 16:23:33,595 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-18 16:23:33,598 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-18 16:23:33,599 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-18 16:23:33,602 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-18 16:23:33,611 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-18 16:23:33,614 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-18 16:23:33,616 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-18 16:23:33,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:23:33,619 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-18 16:23:33,621 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-18 16:23:33,622 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-18 16:23:33,624 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-18 16:23:33,626 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-18 16:23:33,725 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-18 16:23:33,726 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-18 16:23:33,730 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-18 16:23:33,731 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-18 16:23:33,732 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-18 16:23:33,908 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:23:33,909 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:23:33,909 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-18 16:23:33,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,910 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-18 16:23:33,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,911 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-18 16:23:33,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,912 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-18 16:23:33,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:33,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:33,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,915 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-18 16:23:33,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,916 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-18 16:23:33,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,918 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-18 16:23:33,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,920 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-18 16:23:33,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:33,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:33,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,922 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-18 16:23:33,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,924 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-18 16:23:33,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,925 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-18 16:23:33,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,926 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-18 16:23:33,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,927 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-18 16:23:33,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,929 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-18 16:23:33,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:33,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:33,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:33,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:33,931 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-18 16:23:33,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:33,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:33,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:33,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:33,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:33,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:33,944 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:23:33,956 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:23:33,956 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:23:33,957 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:23:33,958 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:23:33,958 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:23:33,958 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-18 16:23:33,997 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 16:23:33,998 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:23:34,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:34,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:34,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:34,031 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-18 16:23:34,031 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-18 16:23:34,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 16:23:34,045 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 52 states and 65 transitions. Complement of second has 8 states. [2018-11-18 16:23:34,045 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-18 16:23:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:23:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 16:23:34,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-18 16:23:34,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:34,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-18 16:23:34,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:34,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-18 16:23:34,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:34,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 65 transitions. [2018-11-18 16:23:34,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:23:34,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 38 states and 45 transitions. [2018-11-18 16:23:34,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 16:23:34,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 16:23:34,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2018-11-18 16:23:34,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:23:34,049 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-18 16:23:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2018-11-18 16:23:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-18 16:23:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 16:23:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-18 16:23:34,051 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-18 16:23:34,051 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-18 16:23:34,051 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 16:23:34,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-11-18 16:23:34,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:23:34,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:23:34,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:23:34,052 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:23:34,052 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:23:34,052 INFO L794 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 754#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 755#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; 756#L36-4 assume true; 762#L36-1 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-3 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 763#L36-4 assume true; 764#L36-1 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; 769#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 768#L36-4 assume true; 766#L36-1 assume !(main_~i~0 < main_~n~0); 745#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 747#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 748#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 760#L14-4 assume true; 753#L14-1 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); 744#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 746#L14-3 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 758#L14-4 assume true; 770#L14-1 assume !(~index~0 < ~size); 767#L14-5 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); 742#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 749#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 751#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 757#L14-4 [2018-11-18 16:23:34,052 INFO L796 eck$LassoCheckResult]: Loop: 757#L14-4 assume true; 752#L14-1 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); 741#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 743#L14-3 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 757#L14-4 [2018-11-18 16:23:34,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:34,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1087808250, now seen corresponding path program 1 times [2018-11-18 16:23:34,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:34,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:34,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:34,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:34,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:23:34,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:23:34,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40abc469-daf3-4698-b6fa-915f3caabbc1/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-18 16:23:34,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:34,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:23:34,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:23:34,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-11-18 16:23:34,211 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 16:23:34,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2006026, now seen corresponding path program 2 times [2018-11-18 16:23:34,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:34,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:34,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:23:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:34,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 16:23:34,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:23:34,276 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand 15 states. [2018-11-18 16:23:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:23:34,402 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2018-11-18 16:23:34,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 16:23:34,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 99 transitions. [2018-11-18 16:23:34,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:23:34,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 61 states and 74 transitions. [2018-11-18 16:23:34,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 16:23:34,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 16:23:34,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 74 transitions. [2018-11-18 16:23:34,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:23:34,405 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 74 transitions. [2018-11-18 16:23:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 74 transitions. [2018-11-18 16:23:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2018-11-18 16:23:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 16:23:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2018-11-18 16:23:34,408 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-18 16:23:34,408 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-18 16:23:34,408 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 16:23:34,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2018-11-18 16:23:34,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:23:34,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:23:34,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:23:34,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:23:34,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:23:34,410 INFO L794 eck$LassoCheckResult]: Stem: 981#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 973#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 974#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; 975#L36-4 assume true; 982#L36-1 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; 985#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 983#L36-4 assume true; 984#L36-1 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; 993#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 992#L36-4 assume true; 989#L36-1 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; 991#L36-3 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 988#L36-4 assume true; 986#L36-1 assume !(main_~i~0 < main_~n~0); 964#L36-5 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 966#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 967#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 1005#L14-4 assume true; 1004#L14-1 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); 1003#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 1002#L14-3 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 980#L14-4 assume true; 972#L14-1 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); 963#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 965#L14-3 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 996#L14-4 assume true; 990#L14-1 assume !(~index~0 < ~size); 987#L14-5 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); 961#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 968#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 970#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 976#L14-4 [2018-11-18 16:23:34,410 INFO L796 eck$LassoCheckResult]: Loop: 976#L14-4 assume true; 971#L14-1 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); 960#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 962#L14-3 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 976#L14-4 [2018-11-18 16:23:34,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash 503075752, now seen corresponding path program 2 times [2018-11-18 16:23:34,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:34,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:34,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:34,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:23:34,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:34,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:34,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2006026, now seen corresponding path program 3 times [2018-11-18 16:23:34,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:34,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:34,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:34,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:23:34,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:34,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:34,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1525335089, now seen corresponding path program 1 times [2018-11-18 16:23:34,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:23:34,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:23:34,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:34,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:23:34,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:23:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:23:34,702 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-18 16:23:35,011 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2018-11-18 16:23:35,232 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2018-11-18 16:23:35,267 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:23:35,267 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:23:35,267 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:23:35,267 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:23:35,267 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:23:35,267 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:23:35,267 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:23:35,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:23:35,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration9_Lasso [2018-11-18 16:23:35,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:23:35,268 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:23:35,270 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-18 16:23:35,271 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-18 16:23:35,272 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-18 16:23:35,273 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-18 16:23:35,274 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-18 16:23:35,275 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-18 16:23:35,277 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-18 16:23:35,278 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-18 16:23:35,279 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-18 16:23:35,281 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-18 16:23:35,283 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-18 16:23:35,284 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-18 16:23:35,286 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-18 16:23:35,287 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-18 16:23:35,288 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-18 16:23:35,289 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-18 16:23:35,290 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-18 16:23:35,291 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-18 16:23:35,292 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-18 16:23:35,293 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-18 16:23:35,293 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-18 16:23:35,391 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-18 16:23:35,392 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-18 16:23:35,393 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-18 16:23:35,546 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:23:35,546 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:23:35,547 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-18 16:23:35,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,549 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-18 16:23:35,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:35,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:35,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,551 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-18 16:23:35,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,552 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-18 16:23:35,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,554 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-18 16:23:35,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,555 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-18 16:23:35,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,556 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-18 16:23:35,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,558 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-18 16:23:35,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,559 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-18 16:23:35,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,561 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-18 16:23:35,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:35,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:35,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,577 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-18 16:23:35,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,579 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-18 16:23:35,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,580 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-18 16:23:35,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,581 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-18 16:23:35,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,583 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-18 16:23:35,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,584 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-18 16:23:35,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,586 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-18 16:23:35,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,587 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-18 16:23:35,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,589 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-18 16:23:35,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,589 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:23:35,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,590 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:23:35,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:35,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,593 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-18 16:23:35,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,594 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-18 16:23:35,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:35,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:35,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,598 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-18 16:23:35,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:35,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:35,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,600 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-18 16:23:35,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:23:35,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:23:35,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:23:35,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:23:35,602 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-18 16:23:35,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:23:35,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:23:35,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:23:35,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:23:35,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:23:35,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:23:35,620 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:23:35,637 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 16:23:35,638 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 16:23:35,638 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:23:35,638 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:23:35,639 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:23:35,639 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 + 2*v_rep(select #length selectionSort_~array.base)_2 Supporting invariants [] [2018-11-18 16:23:35,684 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 16:23:35,686 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:23:35,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:35,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:35,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:35,738 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-18 16:23:35,739 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-18 16:23:35,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-18 16:23:35,755 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 57 states and 69 transitions. Complement of second has 8 states. [2018-11-18 16:23:35,756 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-18 16:23:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:23:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 16:23:35,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 31 letters. Loop has 4 letters. [2018-11-18 16:23:35,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:35,757 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 16:23:35,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:35,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:35,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:35,818 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-18 16:23:35,818 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-18 16:23:35,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-18 16:23:35,832 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 57 states and 69 transitions. Complement of second has 8 states. [2018-11-18 16:23:35,833 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-18 16:23:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:23:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 16:23:35,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 31 letters. Loop has 4 letters. [2018-11-18 16:23:35,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:35,836 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 16:23:35,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:23:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:35,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:23:35,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:23:35,884 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-18 16:23:35,884 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-18 16:23:35,884 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-18 16:23:35,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 66 states and 84 transitions. Complement of second has 7 states. [2018-11-18 16:23:35,897 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-18 16:23:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:23:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-18 16:23:35,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 31 letters. Loop has 4 letters. [2018-11-18 16:23:35,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:35,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 35 letters. Loop has 4 letters. [2018-11-18 16:23:35,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:35,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-18 16:23:35,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:23:35,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 84 transitions. [2018-11-18 16:23:35,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:23:35,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-11-18 16:23:35,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:23:35,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:23:35,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:23:35,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:23:35,900 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:23:35,900 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:23:35,900 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:23:35,900 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 16:23:35,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:23:35,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:23:35,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:23:35,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:23:35 BoogieIcfgContainer [2018-11-18 16:23:35,906 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:23:35,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:23:35,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:23:35,906 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:23:35,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:23:30" (3/4) ... [2018-11-18 16:23:35,909 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:23:35,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:23:35,910 INFO L168 Benchmark]: Toolchain (without parser) took 5920.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.2 MB). Free memory was 959.2 MB in the beginning and 1.2 GB in the end (delta: -200.5 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:23:35,911 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:23:35,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:23:35,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.88 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:23:35,912 INFO L168 Benchmark]: Boogie Preprocessor took 49.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:23:35,913 INFO L168 Benchmark]: RCFGBuilder took 168.83 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-18 16:23:35,913 INFO L168 Benchmark]: BuchiAutomizer took 5521.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -38.3 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:23:35,913 INFO L168 Benchmark]: Witness Printer took 3.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:23:35,916 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.88 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 168.83 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 5521.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -38.3 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 - 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 9 terminating modules (5 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[a] + -4 * 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 + 2 * unknown-#length-unknown[array] and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 10 iterations. TraceHistogramMax:4. Analysis of lassos took 4.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 151 SDtfs, 159 SDslu, 161 SDs, 0 SdLazy, 253 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI2 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: 15ms 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...