./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/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_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/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-aa41828 [2018-11-23 05:17:46,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:17:46,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:17:46,391 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:17:46,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:17:46,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:17:46,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:17:46,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:17:46,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:17:46,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:17:46,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:17:46,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:17:46,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:17:46,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:17:46,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:17:46,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:17:46,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:17:46,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:17:46,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:17:46,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:17:46,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:17:46,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:17:46,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:17:46,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:17:46,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:17:46,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:17:46,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:17:46,410 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:17:46,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:17:46,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:17:46,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:17:46,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:17:46,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:17:46,413 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:17:46,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:17:46,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:17:46,415 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 05:17:46,426 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:17:46,426 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:17:46,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:17:46,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:17:46,427 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:17:46,427 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:17:46,427 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:17:46,428 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:17:46,428 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:17:46,428 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:17:46,428 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:17:46,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:17:46,428 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:17:46,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:17:46,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:17:46,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:17:46,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:17:46,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:17:46,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:17:46,431 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:17:46,431 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:17:46,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:17:46,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:17:46,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:17:46,431 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:17:46,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:17:46,432 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:17:46,432 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:17:46,432 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:17:46,433 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_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/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-23 05:17:46,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:17:46,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:17:46,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:17:46,465 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:17:46,466 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:17:46,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-11-23 05:17:46,497 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/data/9510d9026/619fc4fc0ec74e5c8895fa12fb1394b6/FLAG2659a108f [2018-11-23 05:17:46,890 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:17:46,890 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-11-23 05:17:46,895 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/data/9510d9026/619fc4fc0ec74e5c8895fa12fb1394b6/FLAG2659a108f [2018-11-23 05:17:46,904 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/data/9510d9026/619fc4fc0ec74e5c8895fa12fb1394b6 [2018-11-23 05:17:46,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:17:46,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:17:46,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:17:46,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:17:46,909 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:17:46,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:17:46" (1/1) ... [2018-11-23 05:17:46,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a030d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:46, skipping insertion in model container [2018-11-23 05:17:46,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:17:46" (1/1) ... [2018-11-23 05:17:46,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:17:46,929 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:17:47,033 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:17:47,039 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:17:47,050 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:17:47,058 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:17:47,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47 WrapperNode [2018-11-23 05:17:47,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:17:47,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:17:47,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:17:47,059 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:17:47,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (1/1) ... [2018-11-23 05:17:47,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (1/1) ... [2018-11-23 05:17:47,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:17:47,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:17:47,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:17:47,088 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:17:47,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (1/1) ... [2018-11-23 05:17:47,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (1/1) ... [2018-11-23 05:17:47,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (1/1) ... [2018-11-23 05:17:47,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (1/1) ... [2018-11-23 05:17:47,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (1/1) ... [2018-11-23 05:17:47,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (1/1) ... [2018-11-23 05:17:47,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (1/1) ... [2018-11-23 05:17:47,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:17:47,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:17:47,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:17:47,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:17:47,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:17:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:17:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:17:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:17:47,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:17:47,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:17:47,183 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2018-11-23 05:17:47,183 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2018-11-23 05:17:47,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:17:47,347 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:17:47,348 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 05:17:47,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:17:47 BoogieIcfgContainer [2018-11-23 05:17:47,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:17:47,348 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:17:47,348 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:17:47,351 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:17:47,352 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:17:47,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:17:46" (1/3) ... [2018-11-23 05:17:47,352 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@edc172f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:17:47, skipping insertion in model container [2018-11-23 05:17:47,352 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:17:47,353 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:17:47" (2/3) ... [2018-11-23 05:17:47,353 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@edc172f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:17:47, skipping insertion in model container [2018-11-23 05:17:47,353 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:17:47,353 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:17:47" (3/3) ... [2018-11-23 05:17:47,354 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive_true-termination.c.i [2018-11-23 05:17:47,398 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:17:47,399 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:17:47,399 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:17:47,399 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:17:47,399 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:17:47,399 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:17:47,399 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:17:47,399 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:17:47,399 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:17:47,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-23 05:17:47,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 05:17:47,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:17:47,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:17:47,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 05:17:47,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:17:47,440 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:17:47,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-23 05:17:47,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 05:17:47,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:17:47,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:17:47,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 05:17:47,442 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:17:47,449 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 9#L31true assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 16#L36-3true [2018-11-23 05:17:47,449 INFO L796 eck$LassoCheckResult]: Loop: 16#L36-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 20#L36-2true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 16#L36-3true [2018-11-23 05:17:47,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:47,452 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 05:17:47,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:47,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:47,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:47,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:47,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:47,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:47,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2018-11-23 05:17:47,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:47,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:47,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:47,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:47,540 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2018-11-23 05:17:47,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:47,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:47,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:47,681 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:17:47,682 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:17:47,682 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:17:47,682 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:17:47,682 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:17:47,682 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:17:47,682 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:17:47,682 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:17:47,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-11-23 05:17:47,683 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:17:47,683 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:17:47,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-23 05:17:47,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:47,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:47,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:47,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:47,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:47,926 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:17:47,929 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:17:47,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-23 05:17:47,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:47,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:47,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:47,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:47,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:47,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:47,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:47,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:47,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:47,955 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:17:47,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:47,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:47,957 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:17:47,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:47,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:47,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:47,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:47,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:47,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:47,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:47,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:47,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:47,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:47,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:47,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:47,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:47,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:47,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:47,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:47,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:47,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:47,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:47,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:47,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:47,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:47,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:47,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:47,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:47,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:48,022 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:17:48,061 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 05:17:48,061 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 05:17:48,063 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:17:48,064 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 05:17:48,065 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:17:48,065 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-23 05:17:48,094 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 05:17:48,104 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:17:48,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:48,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:48,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:48,169 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:17:48,170 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2018-11-23 05:17:48,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 9 states. [2018-11-23 05:17:48,217 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-23 05:17:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:17:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-23 05:17:48,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 05:17:48,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:48,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 05:17:48,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:48,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-23 05:17:48,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:48,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2018-11-23 05:17:48,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 05:17:48,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2018-11-23 05:17:48,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 05:17:48,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 05:17:48,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-23 05:17:48,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:17:48,230 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 05:17:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-23 05:17:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 05:17:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 05:17:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-23 05:17:48,248 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 05:17:48,248 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 05:17:48,248 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:17:48,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-23 05:17:48,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 05:17:48,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:17:48,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:17:48,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:17:48,250 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 05:17:48,250 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 129#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 130#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; 131#L36-3 assume !(main_~i~0 < main_~n~0); 124#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 127#selectionSortENTRY [2018-11-23 05:17:48,250 INFO L796 eck$LassoCheckResult]: Loop: 127#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 128#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 132#L14-3 assume !(~index~0 < ~size); 133#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 125#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 127#selectionSortENTRY [2018-11-23 05:17:48,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:48,250 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2018-11-23 05:17:48,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:48,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:48,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:48,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:17:48,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:17:48,293 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:17:48,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:48,293 INFO L82 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2018-11-23 05:17:48,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:48,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:48,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:48,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:48,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:17:48,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:17:48,310 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 05:17:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:17:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:17:48,314 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 05:17:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:48,324 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-23 05:17:48,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:17:48,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-23 05:17:48,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 05:17:48,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-11-23 05:17:48,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 05:17:48,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 05:17:48,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-23 05:17:48,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:17:48,326 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 05:17:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-23 05:17:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 05:17:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 05:17:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-23 05:17:48,328 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 05:17:48,328 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 05:17:48,328 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:17:48,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-23 05:17:48,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 05:17:48,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:17:48,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:17:48,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:17:48,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:48,329 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 165#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 166#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; 167#L36-3 assume !(main_~i~0 < main_~n~0); 160#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 163#selectionSortENTRY [2018-11-23 05:17:48,330 INFO L796 eck$LassoCheckResult]: Loop: 163#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 164#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 168#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 159#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 162#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 171#L14-3 assume !(~index~0 < ~size); 169#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 161#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 163#selectionSortENTRY [2018-11-23 05:17:48,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2018-11-23 05:17:48,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:48,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:48,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:17:48,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:17:48,340 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:17:48,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:48,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2018-11-23 05:17:48,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:48,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:48,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:48,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:48,513 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-23 05:17:48,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:17:48,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:17:48,630 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 05:17:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:48,637 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-23 05:17:48,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:17:48,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-23 05:17:48,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 05:17:48,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2018-11-23 05:17:48,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 05:17:48,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 05:17:48,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-23 05:17:48,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:17:48,639 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 05:17:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-23 05:17:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 05:17:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 05:17:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-23 05:17:48,641 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-23 05:17:48,641 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-23 05:17:48,642 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 05:17:48,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-23 05:17:48,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 05:17:48,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:17:48,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:17:48,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:48,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:48,643 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 202#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 203#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; 204#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 209#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 210#L36-3 assume !(main_~i~0 < main_~n~0); 197#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 200#selectionSortENTRY [2018-11-23 05:17:48,643 INFO L796 eck$LassoCheckResult]: Loop: 200#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 201#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 205#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 196#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 199#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 208#L14-3 assume !(~index~0 < ~size); 206#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 198#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 200#selectionSortENTRY [2018-11-23 05:17:48,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2018-11-23 05:17:48,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:48,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:48,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:48,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2018-11-23 05:17:48,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:48,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:48,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:48,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:48,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:48,670 INFO L82 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2018-11-23 05:17:48,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:48,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:17:48,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:17:48,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:17:48,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:48,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:17:48,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:17:48,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 05:17:48,929 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-23 05:17:49,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:17:49,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:17:49,023 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-23 05:17:49,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:49,065 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 05:17:49,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:17:49,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-23 05:17:49,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 05:17:49,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2018-11-23 05:17:49,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 05:17:49,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 05:17:49,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-23 05:17:49,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:17:49,067 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 05:17:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-23 05:17:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 05:17:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 05:17:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-23 05:17:49,069 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 05:17:49,069 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 05:17:49,069 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 05:17:49,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-23 05:17:49,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 05:17:49,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:17:49,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:17:49,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-23 05:17:49,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:49,071 INFO L794 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 299#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 300#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; 301#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 306#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 307#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 308#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 309#L36-3 assume !(main_~i~0 < main_~n~0); 295#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 297#selectionSortENTRY [2018-11-23 05:17:49,071 INFO L796 eck$LassoCheckResult]: Loop: 297#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 298#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 302#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 293#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 296#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 305#L14-3 assume !(~index~0 < ~size); 303#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 294#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 297#selectionSortENTRY [2018-11-23 05:17:49,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2018-11-23 05:17:49,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:49,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:49,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:49,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:49,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:49,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2018-11-23 05:17:49,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:49,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:49,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:49,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:49,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:49,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:49,098 INFO L82 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2018-11-23 05:17:49,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:49,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:49,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:49,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:49,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:49,249 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-23 05:17:49,471 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2018-11-23 05:17:49,557 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:17:49,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:17:49,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:17:49,557 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:17:49,557 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:17:49,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:17:49,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:17:49,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:17:49,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration5_Lasso [2018-11-23 05:17:49,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:17:49,558 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:17:49,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:49,767 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:17:49,767 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:17:49,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:49,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:49,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:49,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:49,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:49,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:49,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:49,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:49,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:49,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:49,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:49,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:49,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:49,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:49,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:49,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:49,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:49,832 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:17:49,845 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 05:17:49,845 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 05:17:49,845 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:17:49,846 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:17:49,846 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:17:49,846 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-23 05:17:49,871 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 05:17:49,872 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:17:49,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:49,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:49,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:49,975 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-23 05:17:49,975 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-23 05:17:50,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 39 states and 48 transitions. Complement of second has 15 states. [2018-11-23 05:17:50,052 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-23 05:17:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 05:17:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-23 05:17:50,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 8 letters. [2018-11-23 05:17:50,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:50,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 17 letters. Loop has 8 letters. [2018-11-23 05:17:50,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:50,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 16 letters. [2018-11-23 05:17:50,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:50,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2018-11-23 05:17:50,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 05:17:50,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 44 transitions. [2018-11-23 05:17:50,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 05:17:50,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 05:17:50,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-11-23 05:17:50,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:17:50,056 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-23 05:17:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-11-23 05:17:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-11-23 05:17:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 05:17:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-23 05:17:50,058 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 05:17:50,058 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 05:17:50,058 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 05:17:50,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-11-23 05:17:50,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:17:50,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:17:50,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:17:50,059 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:50,059 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:17:50,060 INFO L794 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 456#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 457#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; 458#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 464#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 465#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 466#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 467#L36-3 assume !(main_~i~0 < main_~n~0); 449#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 452#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 454#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 459#L14-3 [2018-11-23 05:17:50,060 INFO L796 eck$LassoCheckResult]: Loop: 459#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 446#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 448#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 459#L14-3 [2018-11-23 05:17:50,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:50,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1305603789, now seen corresponding path program 1 times [2018-11-23 05:17:50,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:50,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:50,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:50,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:50,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:50,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 1 times [2018-11-23 05:17:50,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:50,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:50,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:50,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:50,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash -18607689, now seen corresponding path program 1 times [2018-11-23 05:17:50,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:50,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:50,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:50,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:50,399 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:17:50,399 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:17:50,399 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:17:50,399 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:17:50,399 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:17:50,399 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:17:50,399 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:17:50,399 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:17:50,399 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration6_Lasso [2018-11-23 05:17:50,399 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:17:50,399 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:17:50,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:50,723 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:17:50,723 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:17:50,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:50,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:50,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:50,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:50,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:50,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:50,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:50,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:50,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:50,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:50,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:50,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:50,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:50,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:50,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:50,761 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:17:50,773 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 05:17:50,773 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 05:17:50,773 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:17:50,774 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:17:50,774 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:17:50,774 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, v_rep(select #length selectionSort_~array.base)_1, selectionSort_~array.offset) = -4*selectionSort_~index~0 + 1*v_rep(select #length selectionSort_~array.base)_1 - 1*selectionSort_~array.offset Supporting invariants [] [2018-11-23 05:17:50,802 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 05:17:50,803 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:17:50,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:50,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:50,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:50,838 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:17:50,838 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 05:17:50,855 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 53 transitions. Complement of second has 8 states. [2018-11-23 05:17:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 05:17:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:17:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 05:17:50,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-23 05:17:50,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:50,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 05:17:50,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:50,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-23 05:17:50,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:50,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2018-11-23 05:17:50,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:17:50,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 36 transitions. [2018-11-23 05:17:50,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 05:17:50,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 05:17:50,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2018-11-23 05:17:50,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:17:50,859 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 05:17:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2018-11-23 05:17:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-11-23 05:17:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 05:17:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-23 05:17:50,860 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 05:17:50,860 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 05:17:50,861 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 05:17:50,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-23 05:17:50,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:17:50,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:17:50,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:17:50,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:50,862 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:17:50,862 INFO L794 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 601#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 602#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; 603#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 609#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 610#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 611#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 612#L36-3 assume !(main_~i~0 < main_~n~0); 595#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 597#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 598#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 605#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 594#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 596#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 608#L14-3 assume !(~index~0 < ~size); 606#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 592#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 599#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 600#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 604#L14-3 [2018-11-23 05:17:50,862 INFO L796 eck$LassoCheckResult]: Loop: 604#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 591#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 593#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 604#L14-3 [2018-11-23 05:17:50,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1445216632, now seen corresponding path program 1 times [2018-11-23 05:17:50,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:50,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:50,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 05:17:50,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:17:50,901 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa0f910f-b3f8-4664-b8b9-7c31a9372d0e/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-23 05:17:50,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:50,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:17:51,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:17:51,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-11-23 05:17:51,019 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:17:51,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:51,019 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 2 times [2018-11-23 05:17:51,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:51,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:51,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:51,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 05:17:51,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-23 05:17:51,056 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 15 states. [2018-11-23 05:17:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:51,186 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-23 05:17:51,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 05:17:51,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2018-11-23 05:17:51,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:17:51,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 45 transitions. [2018-11-23 05:17:51,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 05:17:51,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 05:17:51,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-11-23 05:17:51,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:17:51,188 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-23 05:17:51,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-11-23 05:17:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-23 05:17:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 05:17:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-23 05:17:51,190 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 05:17:51,191 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 05:17:51,191 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 05:17:51,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-23 05:17:51,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:17:51,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:17:51,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:17:51,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:51,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:17:51,192 INFO L794 eck$LassoCheckResult]: Stem: 768#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 762#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 763#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; 764#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 770#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 778#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 773#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 771#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 772#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 776#L36-3 assume !(main_~i~0 < main_~n~0); 756#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 758#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 759#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 766#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 755#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 757#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 769#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 775#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 777#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 774#L14-3 assume !(~index~0 < ~size); 767#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 753#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 760#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 761#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 765#L14-3 [2018-11-23 05:17:51,192 INFO L796 eck$LassoCheckResult]: Loop: 765#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 752#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 754#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 765#L14-3 [2018-11-23 05:17:51,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:51,192 INFO L82 PathProgramCache]: Analyzing trace with hash 349648920, now seen corresponding path program 2 times [2018-11-23 05:17:51,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:51,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:51,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:51,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:51,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:51,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:51,214 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 3 times [2018-11-23 05:17:51,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:51,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:51,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:51,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:51,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:51,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1095320754, now seen corresponding path program 1 times [2018-11-23 05:17:51,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:51,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:51,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:51,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:51,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:51,423 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-23 05:17:51,731 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2018-11-23 05:17:51,945 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2018-11-23 05:17:51,980 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:17:51,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:17:51,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:17:51,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:17:51,980 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:17:51,980 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:17:51,980 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:17:51,980 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:17:51,980 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-11-23 05:17:51,980 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:17:51,980 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:17:51,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:51,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:51,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:51,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:51,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:51,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:51,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:51,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:51,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:17:52,280 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:17:52,281 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:17:52,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:52,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:52,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:52,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:52,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,313 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:17:52,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,314 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:17:52,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:52,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:52,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:52,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:52,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:52,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:17:52,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:17:52,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:17:52,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:17:52,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:17:52,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:17:52,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:17:52,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:17:52,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:17:52,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:17:52,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:17:52,364 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:17:52,381 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 05:17:52,381 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 05:17:52,381 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:17:52,382 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:17:52,382 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:17:52,382 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-23 05:17:52,408 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 05:17:52,409 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:17:52,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:52,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:52,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:52,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:17:52,452 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 05:17:52,477 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-11-23 05:17:52,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 05:17:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:17:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 05:17:52,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-23 05:17:52,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:52,479 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 05:17:52,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:52,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:52,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:52,524 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:17:52,524 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 05:17:52,542 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-11-23 05:17:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 05:17:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:17:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 05:17:52,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-23 05:17:52,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:52,545 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 05:17:52,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:52,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:52,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:52,599 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:17:52,599 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 05:17:52,615 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 47 transitions. Complement of second has 7 states. [2018-11-23 05:17:52,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 05:17:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:17:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-23 05:17:52,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-23 05:17:52,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:52,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2018-11-23 05:17:52,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:52,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2018-11-23 05:17:52,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:17:52,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2018-11-23 05:17:52,619 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:17:52,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-23 05:17:52,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 05:17:52,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 05:17:52,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 05:17:52,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:17:52,619 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:17:52,619 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:17:52,619 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:17:52,619 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 05:17:52,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:17:52,620 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:17:52,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 05:17:52,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 05:17:52 BoogieIcfgContainer [2018-11-23 05:17:52,625 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 05:17:52,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:17:52,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:17:52,626 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:17:52,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:17:47" (3/4) ... [2018-11-23 05:17:52,628 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:17:52,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:17:52,629 INFO L168 Benchmark]: Toolchain (without parser) took 5723.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 958.1 MB in the beginning and 1.3 GB in the end (delta: -304.2 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,630 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:17:52,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.71 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.44 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,631 INFO L168 Benchmark]: Boogie Preprocessor took 54.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -220.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,631 INFO L168 Benchmark]: RCFGBuilder took 206.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,632 INFO L168 Benchmark]: BuchiAutomizer took 5276.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.9 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -111.3 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,632 INFO L168 Benchmark]: Witness Printer took 3.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:17:52,636 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.71 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 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 28.44 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -220.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 206.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5276.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.9 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -111.3 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 8 terminating modules (4 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 + unknown-#length-unknown[array] + -1 * 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. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 4.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 112 SDtfs, 133 SDslu, 108 SDs, 0 SdLazy, 255 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital171 mio100 ax100 hnf99 lsp96 ukn69 mio100 lsp66 div100 bol100 ite100 ukn100 eq161 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 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...