./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/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 8fd34d4e7b646f05601c5a6dde65077f6ebc1b52 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 10:41:00,536 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:41:00,537 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:41:00,543 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:41:00,543 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:41:00,543 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:41:00,544 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:41:00,545 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:41:00,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:41:00,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:41:00,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:41:00,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:41:00,547 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:41:00,548 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:41:00,548 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:41:00,549 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:41:00,549 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:41:00,550 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:41:00,551 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:41:00,552 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:41:00,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:41:00,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:41:00,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:41:00,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:41:00,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:41:00,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:41:00,555 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:41:00,556 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:41:00,556 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:41:00,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:41:00,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:41:00,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:41:00,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:41:00,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:41:00,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:41:00,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:41:00,558 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 10:41:00,566 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:41:00,566 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:41:00,567 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:41:00,567 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:41:00,567 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:41:00,568 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 10:41:00,568 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 10:41:00,568 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 10:41:00,568 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 10:41:00,568 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 10:41:00,568 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 10:41:00,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:41:00,568 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 10:41:00,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:41:00,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:41:00,568 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 10:41:00,568 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 10:41:00,569 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 10:41:00,569 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 10:41:00,569 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 10:41:00,569 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:41:00,569 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 10:41:00,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:41:00,569 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:41:00,569 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 10:41:00,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:41:00,569 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:41:00,569 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 10:41:00,570 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 10:41:00,570 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_01f13978-c0a8-4ea2-b929-4c36e4d66db7/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 -> 8fd34d4e7b646f05601c5a6dde65077f6ebc1b52 [2018-12-08 10:41:00,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:41:00,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:41:00,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:41:00,600 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:41:00,600 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:41:00,601 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-12-08 10:41:00,642 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/data/e4acfc787/013db7273f2547d895b64ae2e208e7a3/FLAG82717a04f [2018-12-08 10:41:01,088 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:41:01,088 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-12-08 10:41:01,092 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/data/e4acfc787/013db7273f2547d895b64ae2e208e7a3/FLAG82717a04f [2018-12-08 10:41:01,100 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/data/e4acfc787/013db7273f2547d895b64ae2e208e7a3 [2018-12-08 10:41:01,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:41:01,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 10:41:01,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:41:01,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:41:01,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:41:01,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd688bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01, skipping insertion in model container [2018-12-08 10:41:01,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:41:01,121 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:41:01,216 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:41:01,222 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:41:01,234 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:41:01,244 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:41:01,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01 WrapperNode [2018-12-08 10:41:01,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:41:01,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 10:41:01,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 10:41:01,245 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 10:41:01,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 10:41:01,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:41:01,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:41:01,297 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:41:01,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (1/1) ... [2018-12-08 10:41:01,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:41:01,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:41:01,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:41:01,316 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:41:01,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/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-12-08 10:41:01,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:41:01,349 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2018-12-08 10:41:01,350 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2018-12-08 10:41:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:41:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:41:01,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:41:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 10:41:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:41:01,515 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:41:01,515 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-08 10:41:01,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:41:01 BoogieIcfgContainer [2018-12-08 10:41:01,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:41:01,516 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 10:41:01,516 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 10:41:01,518 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 10:41:01,519 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:41:01,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 10:41:01" (1/3) ... [2018-12-08 10:41:01,519 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bdea3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:41:01, skipping insertion in model container [2018-12-08 10:41:01,519 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:41:01,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:41:01" (2/3) ... [2018-12-08 10:41:01,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bdea3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:41:01, skipping insertion in model container [2018-12-08 10:41:01,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:41:01,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:41:01" (3/3) ... [2018-12-08 10:41:01,521 INFO L375 chiAutomizerObserver]: Analyzing ICFG mergeSort_true-termination.c.i [2018-12-08 10:41:01,556 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:41:01,556 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 10:41:01,556 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 10:41:01,556 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 10:41:01,556 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:41:01,556 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:41:01,556 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 10:41:01,557 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:41:01,557 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 10:41:01,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-12-08 10:41:01,583 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-08 10:41:01,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:01,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:01,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 10:41:01,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 10:41:01,589 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 10:41:01,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-12-08 10:41:01,591 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-08 10:41:01,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:01,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:01,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 10:41:01,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 10:41:01,596 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 30#L35true assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4#L40-3true [2018-12-08 10:41:01,596 INFO L796 eck$LassoCheckResult]: Loop: 4#L40-3true assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 5#L40-2true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4#L40-3true [2018-12-08 10:41:01,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:01,600 INFO L82 PathProgramCache]: Analyzing trace with hash 88447, now seen corresponding path program 1 times [2018-12-08 10:41:01,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:01,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:01,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:01,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:01,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:01,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:01,664 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2018-12-08 10:41:01,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:01,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:01,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:01,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:01,675 INFO L82 PathProgramCache]: Analyzing trace with hash 84999937, now seen corresponding path program 1 times [2018-12-08 10:41:01,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:01,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:01,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:01,794 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:41:01,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:41:01,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:41:01,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:41:01,795 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:41:01,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:41:01,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:41:01,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:41:01,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration1_Lasso [2018-12-08 10:41:01,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:41:01,796 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:41:01,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:01,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:01,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:01,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:01,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:01,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:02,004 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:41:02,007 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:41:02,009 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-12-08 10:41:02,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:02,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:02,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:02,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:02,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:02,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:02,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:02,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:02,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:02,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:02,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:02,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:02,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:02,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:02,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:02,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:02,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:02,016 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-12-08 10:41:02,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:02,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:02,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:02,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:02,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:02,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:02,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:02,020 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-12-08 10:41:02,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:02,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:02,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:02,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:02,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:02,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:02,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:02,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:02,022 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-12-08 10:41:02,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:02,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:02,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:02,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:02,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:02,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:02,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:02,027 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-12-08 10:41:02,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:02,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:02,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:02,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:02,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:02,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:02,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:02,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:02,029 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-12-08 10:41:02,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:02,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:02,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:02,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:02,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:02,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:02,069 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:41:02,089 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 10:41:02,089 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 10:41:02,091 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:41:02,092 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:41:02,092 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:41:02,093 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1, ULTIMATE.start_main_~a~0.offset) = -4*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2018-12-08 10:41:02,098 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 10:41:02,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 10:41:02,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:02,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:02,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:02,173 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-12-08 10:41:02,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 3 states. [2018-12-08 10:41:02,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 3 states. Result 59 states and 83 transitions. Complement of second has 9 states. [2018-12-08 10:41:02,218 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-12-08 10:41:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 10:41:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-12-08 10:41:02,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-08 10:41:02,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:02,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-08 10:41:02,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:02,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-08 10:41:02,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:02,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2018-12-08 10:41:02,225 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-08 10:41:02,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 26 states and 37 transitions. [2018-12-08 10:41:02,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-08 10:41:02,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-08 10:41:02,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2018-12-08 10:41:02,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:41:02,231 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-12-08 10:41:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2018-12-08 10:41:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-08 10:41:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-08 10:41:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-12-08 10:41:02,249 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-12-08 10:41:02,249 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-12-08 10:41:02,249 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 10:41:02,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2018-12-08 10:41:02,250 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-08 10:41:02,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:02,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:02,250 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 10:41:02,250 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:41:02,250 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 165#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 155#L40-3 assume !(main_~i~1 < main_~n~0); 151#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 169#merge_sortENTRY [2018-12-08 10:41:02,250 INFO L796 eck$LassoCheckResult]: Loop: 169#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 158#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 152#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 169#merge_sortENTRY [2018-12-08 10:41:02,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash 84999888, now seen corresponding path program 1 times [2018-12-08 10:41:02,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:02,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:02,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:02,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:41:02,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:41:02,278 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 10:41:02,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2018-12-08 10:41:02,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:02,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:41:02,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:41:02,392 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-12-08 10:41:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:02,402 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2018-12-08 10:41:02,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:41:02,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-12-08 10:41:02,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-08 10:41:02,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2018-12-08 10:41:02,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-08 10:41:02,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-08 10:41:02,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-12-08 10:41:02,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:41:02,406 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-08 10:41:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-12-08 10:41:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-08 10:41:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-08 10:41:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-12-08 10:41:02,408 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-12-08 10:41:02,409 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-12-08 10:41:02,409 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 10:41:02,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2018-12-08 10:41:02,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-08 10:41:02,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:02,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:02,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:02,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:41:02,410 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 223#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 224#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 214#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 215#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 216#L40-3 assume !(main_~i~1 < main_~n~0); 211#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 228#merge_sortENTRY [2018-12-08 10:41:02,410 INFO L796 eck$LassoCheckResult]: Loop: 228#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 217#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 209#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 228#merge_sortENTRY [2018-12-08 10:41:02,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash 80563154, now seen corresponding path program 1 times [2018-12-08 10:41:02,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:02,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 2 times [2018-12-08 10:41:02,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:02,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:02,432 INFO L82 PathProgramCache]: Analyzing trace with hash -829797441, now seen corresponding path program 1 times [2018-12-08 10:41:02,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:02,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:02,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:02,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:02,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:41:02,462 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/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-12-08 10:41:02,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:02,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:02,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:41:02,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-08 10:41:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 10:41:02,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:41:02,620 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-12-08 10:41:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:02,657 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-12-08 10:41:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:41:02,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2018-12-08 10:41:02,659 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-08 10:41:02,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2018-12-08 10:41:02,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-08 10:41:02,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 10:41:02,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-12-08 10:41:02,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:41:02,661 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-12-08 10:41:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-12-08 10:41:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-12-08 10:41:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 10:41:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-08 10:41:02,663 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-08 10:41:02,663 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-08 10:41:02,663 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 10:41:02,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-08 10:41:02,663 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-08 10:41:02,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:02,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:02,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-08 10:41:02,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:41:02,664 INFO L794 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 330#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 331#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 320#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 321#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 322#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 323#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 341#L40-3 assume !(main_~i~1 < main_~n~0); 316#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 335#merge_sortENTRY [2018-12-08 10:41:02,664 INFO L796 eck$LassoCheckResult]: Loop: 335#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 324#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 315#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 335#merge_sortENTRY [2018-12-08 10:41:02,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash 111829076, now seen corresponding path program 2 times [2018-12-08 10:41:02,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:02,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:02,677 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 3 times [2018-12-08 10:41:02,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:02,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:02,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:02,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:02,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1394618371, now seen corresponding path program 2 times [2018-12-08 10:41:02,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:02,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:02,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:02,998 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:41:02,998 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:41:02,998 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:41:02,998 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:41:02,999 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:41:02,999 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:41:02,999 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:41:02,999 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:41:02,999 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration4_Lasso [2018-12-08 10:41:02,999 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:41:02,999 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:41:03,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,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-12-08 10:41:03,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-12-08 10:41:03,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-12-08 10:41:03,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-12-08 10:41:03,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-12-08 10:41:03,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-12-08 10:41:03,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-12-08 10:41:03,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:03,231 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:41:03,231 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:41:03,232 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-12-08 10:41:03,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,234 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-12-08 10:41:03,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,236 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-12-08 10:41:03,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,237 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-12-08 10:41:03,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,239 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-12-08 10:41:03,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,240 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-12-08 10:41:03,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,241 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-12-08 10:41:03,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,242 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-12-08 10:41:03,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,244 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-12-08 10:41:03,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,245 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-12-08 10:41:03,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,247 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-12-08 10:41:03,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,249 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-12-08 10:41:03,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,251 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-12-08 10:41:03,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,252 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-12-08 10:41:03,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,254 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-12-08 10:41:03,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,256 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-12-08 10:41:03,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:03,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:03,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,258 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-12-08 10:41:03,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,260 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-12-08 10:41:03,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:03,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,264 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-12-08 10:41:03,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,266 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-12-08 10:41:03,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,268 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-12-08 10:41:03,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,269 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-12-08 10:41:03,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,271 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-12-08 10:41:03,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,273 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-12-08 10:41:03,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:03,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:03,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,276 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-12-08 10:41:03,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,278 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-12-08 10:41:03,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,280 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-12-08 10:41:03,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,282 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-12-08 10:41:03,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,284 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-12-08 10:41:03,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,286 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-12-08 10:41:03,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,288 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-12-08 10:41:03,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,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-12-08 10:41:03,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,291 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-12-08 10:41:03,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,293 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-12-08 10:41:03,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,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-12-08 10:41:03,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,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-12-08 10:41:03,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,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-12-08 10:41:03,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,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-12-08 10:41:03,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,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-12-08 10:41:03,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,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-12-08 10:41:03,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,305 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-12-08 10:41:03,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,308 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-12-08 10:41:03,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,310 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-12-08 10:41:03,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,312 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-12-08 10:41:03,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,314 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-12-08 10:41:03,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,316 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-12-08 10:41:03,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:03,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:03,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:03,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,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-12-08 10:41:03,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,317 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:41:03,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,318 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:41:03,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:03,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:03,321 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-12-08 10:41:03,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:03,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:03,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:03,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:03,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:03,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:03,337 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:41:03,343 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 10:41:03,343 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 10:41:03,343 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:41:03,344 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:41:03,344 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:41:03,344 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2018-12-08 10:41:03,346 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-08 10:41:03,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:03,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:03,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:03,494 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 10:41:03,494 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-08 10:41:04,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 37 states and 46 transitions. Complement of second has 5 states. [2018-12-08 10:41:04,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 10:41:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 10:41:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-12-08 10:41:04,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-08 10:41:04,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:04,993 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 10:41:04,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:05,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:05,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:05,040 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 10:41:05,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-08 10:41:05,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2018-12-08 10:41:05,070 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-12-08 10:41:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 10:41:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-08 10:41:05,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-08 10:41:05,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:05,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2018-12-08 10:41:05,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:05,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-08 10:41:05,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:05,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-12-08 10:41:05,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-08 10:41:05,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 49 transitions. [2018-12-08 10:41:05,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-08 10:41:05,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-08 10:41:05,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2018-12-08 10:41:05,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:05,073 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-12-08 10:41:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2018-12-08 10:41:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-08 10:41:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-08 10:41:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-12-08 10:41:05,075 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-12-08 10:41:05,075 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-12-08 10:41:05,075 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 10:41:05,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2018-12-08 10:41:05,075 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-08 10:41:05,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:05,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:05,076 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:05,076 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:05,076 INFO L794 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 560#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 561#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 548#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 549#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 550#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 551#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 575#L40-3 assume !(main_~i~1 < main_~n~0); 544#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 565#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 554#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 543#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 572#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 552#L24 assume ~n < 2; 553#L8 assume true; 562#merge_sortEXIT >#86#return; 542#L27-1 [2018-12-08 10:41:05,076 INFO L796 eck$LassoCheckResult]: Loop: 542#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 571#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 574#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 545#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 571#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 574#L24 assume ~n < 2; 558#L8 assume true; 573#merge_sortEXIT >#86#return; 542#L27-1 [2018-12-08 10:41:05,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744228, now seen corresponding path program 1 times [2018-12-08 10:41:05,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:05,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:05,091 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 1 times [2018-12-08 10:41:05,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:05,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:05,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:05,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:05,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1064649429, now seen corresponding path program 1 times [2018-12-08 10:41:05,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:05,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:05,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:05,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 10:41:05,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:41:05,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/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-12-08 10:41:05,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:05,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:05,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:41:05,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-12-08 10:41:05,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 10:41:05,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:41:05,424 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 13 states. [2018-12-08 10:41:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:05,509 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-12-08 10:41:05,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 10:41:05,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2018-12-08 10:41:05,510 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-12-08 10:41:05,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 65 states and 81 transitions. [2018-12-08 10:41:05,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-12-08 10:41:05,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-12-08 10:41:05,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2018-12-08 10:41:05,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:05,512 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2018-12-08 10:41:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2018-12-08 10:41:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-08 10:41:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-08 10:41:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2018-12-08 10:41:05,514 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-12-08 10:41:05,514 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-12-08 10:41:05,514 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 10:41:05,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2018-12-08 10:41:05,515 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-12-08 10:41:05,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:05,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:05,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:05,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:05,516 INFO L794 eck$LassoCheckResult]: Stem: 774#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 761#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 762#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 744#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 745#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 746#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 747#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 791#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 788#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 787#L40-3 assume !(main_~i~1 < main_~n~0); 751#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 782#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 750#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 752#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 778#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 779#L24 assume ~n < 2; 804#L8 assume true; 801#merge_sortEXIT >#86#return; 755#L27-1 [2018-12-08 10:41:05,516 INFO L796 eck$LassoCheckResult]: Loop: 755#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 780#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 802#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 754#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 780#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 802#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 754#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 780#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 802#L24 assume ~n < 2; 803#L8 assume true; 799#merge_sortEXIT >#86#return; 755#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 780#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 802#L24 assume ~n < 2; 803#L8 assume true; 799#merge_sortEXIT >#88#return; 765#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 766#L11-3 assume !(merge_~k~0 < merge_~n); 775#L11-4 merge_~i~0 := 0; 768#L17-3 assume !(merge_~i~0 < merge_~n); 758#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 759#L8 assume true; 800#merge_sortEXIT >#86#return; 755#L27-1 [2018-12-08 10:41:05,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:05,516 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 2 times [2018-12-08 10:41:05,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:05,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:05,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:05,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash -729398939, now seen corresponding path program 1 times [2018-12-08 10:41:05,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:05,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 10:41:05,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:41:05,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:41:05,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:05,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 10:41:05,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 10:41:05,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-12-08 10:41:05,598 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 10:41:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:41:05,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:41:05,598 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-12-08 10:41:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:05,636 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-12-08 10:41:05,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:41:05,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 102 transitions. [2018-12-08 10:41:05,638 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-12-08 10:41:05,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 102 transitions. [2018-12-08 10:41:05,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-12-08 10:41:05,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-12-08 10:41:05,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 102 transitions. [2018-12-08 10:41:05,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:05,640 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 102 transitions. [2018-12-08 10:41:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 102 transitions. [2018-12-08 10:41:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-12-08 10:41:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-08 10:41:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-12-08 10:41:05,643 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-12-08 10:41:05,643 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-12-08 10:41:05,643 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 10:41:05,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 82 transitions. [2018-12-08 10:41:05,644 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-12-08 10:41:05,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:05,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:05,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:05,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:05,644 INFO L794 eck$LassoCheckResult]: Stem: 996#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 984#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 985#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 966#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 967#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 968#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 969#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1012#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1011#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1010#L40-3 assume !(main_~i~1 < main_~n~0); 975#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1006#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 973#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 974#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1002#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1003#L24 assume ~n < 2; 1026#L8 assume true; 1022#merge_sortEXIT >#86#return; 978#L27-1 [2018-12-08 10:41:05,644 INFO L796 eck$LassoCheckResult]: Loop: 978#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1021#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1013#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 977#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1021#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1013#L24 assume ~n < 2; 1014#L8 assume true; 1025#merge_sortEXIT >#86#return; 978#L27-1 [2018-12-08 10:41:05,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:05,645 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 3 times [2018-12-08 10:41:05,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:05,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:05,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:05,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 2 times [2018-12-08 10:41:05,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:05,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:05,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:05,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:05,666 INFO L82 PathProgramCache]: Analyzing trace with hash -889748845, now seen corresponding path program 2 times [2018-12-08 10:41:05,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:05,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:06,089 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-12-08 10:41:06,250 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:41:06,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:41:06,251 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:41:06,251 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:41:06,251 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:41:06,251 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:41:06,251 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:41:06,251 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:41:06,251 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration7_Lasso [2018-12-08 10:41:06,251 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:41:06,251 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:41:06,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:06,504 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:41:06,504 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:41:06,504 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-12-08 10:41:06,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,506 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-12-08 10:41:06,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,507 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-12-08 10:41:06,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,508 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-12-08 10:41:06,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,509 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-12-08 10:41:06,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:06,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:06,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,511 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-12-08 10:41:06,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,512 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-12-08 10:41:06,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,513 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-12-08 10:41:06,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,514 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-12-08 10:41:06,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,515 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-12-08 10:41:06,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,516 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-12-08 10:41:06,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,517 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-12-08 10:41:06,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,518 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-12-08 10:41:06,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,519 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-12-08 10:41:06,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,520 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-12-08 10:41:06,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,521 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-12-08 10:41:06,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,522 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-12-08 10:41:06,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,522 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-12-08 10:41:06,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,523 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-12-08 10:41:06,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,524 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-12-08 10:41:06,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,525 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-12-08 10:41:06,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,526 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-12-08 10:41:06,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,527 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-12-08 10:41:06,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,528 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-12-08 10:41:06,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:06,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:06,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,529 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-12-08 10:41:06,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,530 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-12-08 10:41:06,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,531 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-12-08 10:41:06,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,532 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-12-08 10:41:06,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,533 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-12-08 10:41:06,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,534 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-12-08 10:41:06,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,535 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-12-08 10:41:06,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,537 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-12-08 10:41:06,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,538 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-12-08 10:41:06,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,540 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-12-08 10:41:06,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,542 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-12-08 10:41:06,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,543 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-12-08 10:41:06,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,545 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-12-08 10:41:06,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,546 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-12-08 10:41:06,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,548 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-12-08 10:41:06,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:06,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:06,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:06,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:06,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:06,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:06,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:06,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:06,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:06,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,557 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-12-08 10:41:06,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:06,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:06,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:06,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,562 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:41:06,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,563 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:41:06,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:06,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:06,566 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-12-08 10:41:06,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:06,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:06,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:06,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:06,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:06,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:06,581 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:41:06,610 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 10:41:06,611 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 10:41:06,611 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:41:06,612 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:41:06,612 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:41:06,612 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~n, merge_sort_~m~0) = 1*merge_sort_~n - 1*merge_sort_~m~0 Supporting invariants [] [2018-12-08 10:41:06,612 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 10:41:06,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:06,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:06,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:06,722 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-08 10:41:06,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 82 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-12-08 10:41:06,815 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 82 transitions. cyclomatic complexity: 23. Second operand 7 states. Result 325 states and 440 transitions. Complement of second has 28 states. [2018-12-08 10:41:06,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-08 10:41:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 10:41:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2018-12-08 10:41:06,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 8 letters. [2018-12-08 10:41:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:06,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 26 letters. Loop has 8 letters. [2018-12-08 10:41:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:06,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 16 letters. [2018-12-08 10:41:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:06,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 440 transitions. [2018-12-08 10:41:06,820 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2018-12-08 10:41:06,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 237 states and 327 transitions. [2018-12-08 10:41:06,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2018-12-08 10:41:06,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2018-12-08 10:41:06,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 327 transitions. [2018-12-08 10:41:06,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:06,822 INFO L705 BuchiCegarLoop]: Abstraction has 237 states and 327 transitions. [2018-12-08 10:41:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 327 transitions. [2018-12-08 10:41:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 215. [2018-12-08 10:41:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-12-08 10:41:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 291 transitions. [2018-12-08 10:41:06,831 INFO L728 BuchiCegarLoop]: Abstraction has 215 states and 291 transitions. [2018-12-08 10:41:06,831 INFO L608 BuchiCegarLoop]: Abstraction has 215 states and 291 transitions. [2018-12-08 10:41:06,831 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 10:41:06,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 291 transitions. [2018-12-08 10:41:06,832 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2018-12-08 10:41:06,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:06,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:06,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:06,833 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 10:41:06,833 INFO L794 eck$LassoCheckResult]: Stem: 1546#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1521#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 1522#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1496#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1497#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1498#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1499#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1575#L40-3 assume !(main_~i~1 < main_~n~0); 1490#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1536#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1675#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1554#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1553#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1555#L24 assume ~n < 2; 1677#L8 assume true; 1676#merge_sortEXIT >#86#return; 1501#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1674#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1500#L24 assume ~n < 2; 1502#L8 assume true; 1523#merge_sortEXIT >#88#return; 1526#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1527#L11-3 assume !!(merge_~k~0 < merge_~n); 1540#L12 [2018-12-08 10:41:06,833 INFO L796 eck$LassoCheckResult]: Loop: 1540#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 1519#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 1543#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1547#L11-3 assume !!(merge_~k~0 < merge_~n); 1540#L12 [2018-12-08 10:41:06,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:06,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 1 times [2018-12-08 10:41:06,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:06,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:06,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:06,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1495548, now seen corresponding path program 1 times [2018-12-08 10:41:06,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:06,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:06,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:06,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:06,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1497601855, now seen corresponding path program 1 times [2018-12-08 10:41:06,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:06,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 10:41:06,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:41:06,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:41:06,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:41:06,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:41:06,916 INFO L87 Difference]: Start difference. First operand 215 states and 291 transitions. cyclomatic complexity: 100 Second operand 4 states. [2018-12-08 10:41:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:06,939 INFO L93 Difference]: Finished difference Result 328 states and 445 transitions. [2018-12-08 10:41:06,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:41:06,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 328 states and 445 transitions. [2018-12-08 10:41:06,943 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 134 [2018-12-08 10:41:06,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 328 states to 328 states and 445 transitions. [2018-12-08 10:41:06,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-12-08 10:41:06,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-12-08 10:41:06,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 328 states and 445 transitions. [2018-12-08 10:41:06,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:06,948 INFO L705 BuchiCegarLoop]: Abstraction has 328 states and 445 transitions. [2018-12-08 10:41:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 445 transitions. [2018-12-08 10:41:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2018-12-08 10:41:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-08 10:41:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 354 transitions. [2018-12-08 10:41:06,962 INFO L728 BuchiCegarLoop]: Abstraction has 269 states and 354 transitions. [2018-12-08 10:41:06,963 INFO L608 BuchiCegarLoop]: Abstraction has 269 states and 354 transitions. [2018-12-08 10:41:06,963 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 10:41:06,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 354 transitions. [2018-12-08 10:41:06,964 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2018-12-08 10:41:06,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:06,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:06,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:06,965 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:06,965 INFO L794 eck$LassoCheckResult]: Stem: 2105#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2082#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 2083#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 2053#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 2054#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2055#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 2056#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2057#L40-3 assume !(main_~i~1 < main_~n~0); 2044#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 2090#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2150#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 2116#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 2117#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2161#L24 assume ~n < 2; 2160#L8 assume true; 2159#merge_sortEXIT >#86#return; 2059#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 2114#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2058#L24 assume ~n < 2; 2060#L8 assume true; 2103#merge_sortEXIT >#88#return; 2086#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 2087#L11-3 assume !!(merge_~k~0 < merge_~n); 2096#L12 [2018-12-08 10:41:06,965 INFO L796 eck$LassoCheckResult]: Loop: 2096#L12 assume !(merge_~j~0 == merge_~n); 2065#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 2067#L14 assume !(merge_#t~mem7 < merge_#t~mem8);merge_#t~post11 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post11;call merge_#t~mem12 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post11, 4);merge_#t~ite13 := merge_#t~mem12; 2092#L14-2 merge_#t~ite14 := merge_#t~ite13; 2078#L13-2 merge_#t~ite15 := merge_#t~ite14; 2079#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 2100#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 2310#L11-3 assume !!(merge_~k~0 < merge_~n); 2096#L12 [2018-12-08 10:41:06,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 2 times [2018-12-08 10:41:06,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:06,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:06,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:06,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:06,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:06,976 INFO L82 PathProgramCache]: Analyzing trace with hash 291245299, now seen corresponding path program 1 times [2018-12-08 10:41:06,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:06,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:06,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:06,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:06,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash -800163658, now seen corresponding path program 1 times [2018-12-08 10:41:06,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:06,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:07,331 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-12-08 10:41:07,733 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2018-12-08 10:41:07,795 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:41:07,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:41:07,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:41:07,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:41:07,796 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:41:07,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:41:07,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:41:07,796 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:41:07,796 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration9_Lasso [2018-12-08 10:41:07,796 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:41:07,796 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:41:07,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:07,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:07,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:07,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:07,986 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2018-12-08 10:41:08,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:08,228 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-12-08 10:41:08,506 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-08 10:41:08,571 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:41:08,571 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:41:08,572 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-12-08 10:41:08,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:08,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:08,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:08,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:08,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:08,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:08,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:08,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:08,573 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-12-08 10:41:08,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:08,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:08,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:08,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:08,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:08,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:08,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:08,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:08,575 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-12-08 10:41:08,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:08,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:08,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:08,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:08,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:08,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:08,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:08,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:08,576 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-12-08 10:41:08,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:08,576 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:41:08,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:08,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:08,577 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:41:08,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:08,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:08,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:08,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:08,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:08,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:08,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:08,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:08,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:08,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:08,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:08,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:08,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:08,580 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-08 10:41:08,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:08,603 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-12-08 10:41:08,603 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-08 10:41:09,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:41:10,111 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2018-12-08 10:41:10,111 INFO L444 ModelExtractionUtils]: 176 out of 208 variables were initially zero. Simplification set additionally 28 variables to zero. [2018-12-08 10:41:10,112 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:41:10,113 INFO L440 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2018-12-08 10:41:10,113 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:41:10,113 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, merge_sort_merge_~i~0, v_rep(select #length merge_sort_merge_~x~0.base)_1) = -1*merge_sort_merge_~a.offset - 4*merge_sort_merge_~i~0 + 1*v_rep(select #length merge_sort_merge_~x~0.base)_1 Supporting invariants [] [2018-12-08 10:41:10,139 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 10:41:10,141 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 10:41:10,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:10,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:10,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:10,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2018-12-08 10:41:10,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 269 states and 354 transitions. cyclomatic complexity: 109 Second operand 11 states. [2018-12-08 10:41:10,426 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 269 states and 354 transitions. cyclomatic complexity: 109. Second operand 11 states. Result 368 states and 493 transitions. Complement of second has 24 states. [2018-12-08 10:41:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-08 10:41:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 10:41:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2018-12-08 10:41:10,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 38 transitions. Stem has 23 letters. Loop has 8 letters. [2018-12-08 10:41:10,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:10,427 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 10:41:10,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:10,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:10,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:10,550 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 4 loop predicates [2018-12-08 10:41:10,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 269 states and 354 transitions. cyclomatic complexity: 109 Second operand 11 states. [2018-12-08 10:41:10,705 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 269 states and 354 transitions. cyclomatic complexity: 109. Second operand 11 states. Result 378 states and 505 transitions. Complement of second has 31 states. [2018-12-08 10:41:10,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 4 non-accepting loop states 2 accepting loop states [2018-12-08 10:41:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 10:41:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-12-08 10:41:10,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 41 transitions. Stem has 23 letters. Loop has 8 letters. [2018-12-08 10:41:10,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:10,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 41 transitions. Stem has 31 letters. Loop has 8 letters. [2018-12-08 10:41:10,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:10,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 41 transitions. Stem has 23 letters. Loop has 16 letters. [2018-12-08 10:41:10,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:10,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 505 transitions. [2018-12-08 10:41:10,710 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 124 [2018-12-08 10:41:10,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 368 states and 493 transitions. [2018-12-08 10:41:10,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2018-12-08 10:41:10,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2018-12-08 10:41:10,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 493 transitions. [2018-12-08 10:41:10,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:10,714 INFO L705 BuchiCegarLoop]: Abstraction has 368 states and 493 transitions. [2018-12-08 10:41:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 493 transitions. [2018-12-08 10:41:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 301. [2018-12-08 10:41:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-08 10:41:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 394 transitions. [2018-12-08 10:41:10,726 INFO L728 BuchiCegarLoop]: Abstraction has 301 states and 394 transitions. [2018-12-08 10:41:10,726 INFO L608 BuchiCegarLoop]: Abstraction has 301 states and 394 transitions. [2018-12-08 10:41:10,726 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 10:41:10,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 394 transitions. [2018-12-08 10:41:10,727 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2018-12-08 10:41:10,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:10,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:10,728 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:10,728 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 10:41:10,728 INFO L794 eck$LassoCheckResult]: Stem: 3481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3450#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 3451#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 3419#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 3420#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3421#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 3422#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3496#L40-3 assume !(main_~i~1 < main_~n~0); 3412#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 3521#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3518#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3512#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 3514#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3519#L24 assume ~n < 2; 3516#L8 assume true; 3511#merge_sortEXIT >#86#return; 3504#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 3505#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3510#L24 assume ~n < 2; 3506#L8 assume true; 3507#merge_sortEXIT >#88#return; 3503#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 3697#L11-3 assume !!(merge_~k~0 < merge_~n); 3498#L12 assume !(merge_~j~0 == merge_~n); 3474#L13 assume merge_~i~0 == merge_~m;merge_#t~post5 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post5;call merge_#t~mem6 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post5, 4);merge_#t~ite14 := merge_#t~mem6; 3446#L13-2 [2018-12-08 10:41:10,728 INFO L796 eck$LassoCheckResult]: Loop: 3446#L13-2 merge_#t~ite15 := merge_#t~ite14; 3447#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 3475#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 3569#L11-3 assume !!(merge_~k~0 < merge_~n); 3681#L12 assume !(merge_~j~0 == merge_~n); 3472#L13 assume merge_~i~0 == merge_~m;merge_#t~post5 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post5;call merge_#t~mem6 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post5, 4);merge_#t~ite14 := merge_#t~mem6; 3446#L13-2 [2018-12-08 10:41:10,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1360216135, now seen corresponding path program 1 times [2018-12-08 10:41:10,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:10,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:10,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 10:41:10,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:41:10,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:41:10,751 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 10:41:10,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:10,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1895288687, now seen corresponding path program 1 times [2018-12-08 10:41:10,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:10,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:41:10,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:41:10,818 INFO L87 Difference]: Start difference. First operand 301 states and 394 transitions. cyclomatic complexity: 119 Second operand 4 states. [2018-12-08 10:41:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:10,837 INFO L93 Difference]: Finished difference Result 383 states and 502 transitions. [2018-12-08 10:41:10,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:41:10,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 383 states and 502 transitions. [2018-12-08 10:41:10,839 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 162 [2018-12-08 10:41:10,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 383 states to 383 states and 502 transitions. [2018-12-08 10:41:10,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2018-12-08 10:41:10,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2018-12-08 10:41:10,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 383 states and 502 transitions. [2018-12-08 10:41:10,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:10,842 INFO L705 BuchiCegarLoop]: Abstraction has 383 states and 502 transitions. [2018-12-08 10:41:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 502 transitions. [2018-12-08 10:41:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 364. [2018-12-08 10:41:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-08 10:41:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 475 transitions. [2018-12-08 10:41:10,851 INFO L728 BuchiCegarLoop]: Abstraction has 364 states and 475 transitions. [2018-12-08 10:41:10,851 INFO L608 BuchiCegarLoop]: Abstraction has 364 states and 475 transitions. [2018-12-08 10:41:10,851 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 10:41:10,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 475 transitions. [2018-12-08 10:41:10,852 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 162 [2018-12-08 10:41:10,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:10,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:10,852 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:10,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:41:10,853 INFO L794 eck$LassoCheckResult]: Stem: 4172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4140#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 4141#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4112#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 4113#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4114#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 4115#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4116#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 4189#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4188#L40-3 assume !(main_~i~1 < main_~n~0); 4105#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 4220#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4121#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4122#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4178#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4179#L24 assume ~n < 2; 4205#L8 assume true; 4204#merge_sortEXIT >#86#return; 4119#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 4203#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4199#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4109#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4194#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4247#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4217#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4248#merge_sortENTRY [2018-12-08 10:41:10,853 INFO L796 eck$LassoCheckResult]: Loop: 4248#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4214#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4215#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4248#merge_sortENTRY [2018-12-08 10:41:10,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:10,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1495319133, now seen corresponding path program 3 times [2018-12-08 10:41:10,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:10,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:10,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 10:41:10,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:41:10,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:41:10,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 10:41:10,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 10:41:10,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:41:10,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:11,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:41:11,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2018-12-08 10:41:11,041 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 10:41:11,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:11,041 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 4 times [2018-12-08 10:41:11,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:11,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:11,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:11,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:11,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:11,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 10:41:11,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-08 10:41:11,142 INFO L87 Difference]: Start difference. First operand 364 states and 475 transitions. cyclomatic complexity: 137 Second operand 18 states. [2018-12-08 10:41:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:11,451 INFO L93 Difference]: Finished difference Result 385 states and 499 transitions. [2018-12-08 10:41:11,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-08 10:41:11,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 385 states and 499 transitions. [2018-12-08 10:41:11,453 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 202 [2018-12-08 10:41:11,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 385 states to 377 states and 491 transitions. [2018-12-08 10:41:11,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 333 [2018-12-08 10:41:11,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 339 [2018-12-08 10:41:11,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 491 transitions. [2018-12-08 10:41:11,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:11,456 INFO L705 BuchiCegarLoop]: Abstraction has 377 states and 491 transitions. [2018-12-08 10:41:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 491 transitions. [2018-12-08 10:41:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 245. [2018-12-08 10:41:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-08 10:41:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 312 transitions. [2018-12-08 10:41:11,462 INFO L728 BuchiCegarLoop]: Abstraction has 245 states and 312 transitions. [2018-12-08 10:41:11,462 INFO L608 BuchiCegarLoop]: Abstraction has 245 states and 312 transitions. [2018-12-08 10:41:11,462 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-08 10:41:11,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 312 transitions. [2018-12-08 10:41:11,463 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 114 [2018-12-08 10:41:11,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:11,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:11,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:11,464 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:11,464 INFO L794 eck$LassoCheckResult]: Stem: 5021#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4999#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 5000#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4977#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 4978#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4979#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 4980#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5035#L40-3 assume !(main_~i~1 < main_~n~0); 4975#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 5075#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5073#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 5070#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 5071#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5074#L24 assume ~n < 2; 5072#L8 assume true; 5069#merge_sortEXIT >#86#return; 5044#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 5045#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5050#L24 assume ~n < 2; 5046#L8 assume true; 5047#merge_sortEXIT >#88#return; 5041#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 5040#L11-3 assume !!(merge_~k~0 < merge_~n); 5038#L12 assume !(merge_~j~0 == merge_~n); 5039#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 5202#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 5200#L14-2 [2018-12-08 10:41:11,464 INFO L796 eck$LassoCheckResult]: Loop: 5200#L14-2 merge_#t~ite14 := merge_#t~ite13; 5201#L13-2 merge_#t~ite15 := merge_#t~ite14; 5196#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 5197#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 5192#L11-3 assume !!(merge_~k~0 < merge_~n); 5193#L12 assume !(merge_~j~0 == merge_~n); 5207#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 5203#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 5200#L14-2 [2018-12-08 10:41:11,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash -782972685, now seen corresponding path program 1 times [2018-12-08 10:41:11,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:11,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:11,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:11,477 INFO L82 PathProgramCache]: Analyzing trace with hash -695534387, now seen corresponding path program 1 times [2018-12-08 10:41:11,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:11,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:11,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:11,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1287081025, now seen corresponding path program 1 times [2018-12-08 10:41:11,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:11,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:11,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:11,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 10:41:11,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:41:11,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:41:11,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:11,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 10:41:11,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:41:11,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-12-08 10:41:11,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 10:41:11,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-08 10:41:11,834 INFO L87 Difference]: Start difference. First operand 245 states and 312 transitions. cyclomatic complexity: 82 Second operand 19 states. [2018-12-08 10:41:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:12,329 INFO L93 Difference]: Finished difference Result 312 states and 390 transitions. [2018-12-08 10:41:12,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 10:41:12,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 390 transitions. [2018-12-08 10:41:12,330 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 112 [2018-12-08 10:41:12,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 312 states and 390 transitions. [2018-12-08 10:41:12,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2018-12-08 10:41:12,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2018-12-08 10:41:12,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 390 transitions. [2018-12-08 10:41:12,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:12,332 INFO L705 BuchiCegarLoop]: Abstraction has 312 states and 390 transitions. [2018-12-08 10:41:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 390 transitions. [2018-12-08 10:41:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 231. [2018-12-08 10:41:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-08 10:41:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2018-12-08 10:41:12,336 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-12-08 10:41:12,336 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-12-08 10:41:12,336 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-08 10:41:12,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 286 transitions. [2018-12-08 10:41:12,337 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 80 [2018-12-08 10:41:12,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:12,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:12,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:12,337 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 10:41:12,337 INFO L794 eck$LassoCheckResult]: Stem: 5736#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5712#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 5713#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 5687#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 5688#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5689#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 5690#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5691#L40-3 assume !(main_~i~1 < main_~n~0); 5683#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 5780#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5777#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 5770#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 5773#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5779#L24 assume ~n < 2; 5775#L8 assume true; 5769#merge_sortEXIT >#86#return; 5762#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 5763#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5768#L24 assume ~n < 2; 5764#L8 assume true; 5765#merge_sortEXIT >#88#return; 5758#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 5759#L11-3 assume !!(merge_~k~0 < merge_~n); 5748#L12 assume !(merge_~j~0 == merge_~n); 5749#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 5891#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 5892#L14-2 merge_#t~ite14 := merge_#t~ite13; 5885#L13-2 merge_#t~ite15 := merge_#t~ite14; 5872#L12-2 [2018-12-08 10:41:12,337 INFO L796 eck$LassoCheckResult]: Loop: 5872#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 5868#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 5869#L11-3 assume !!(merge_~k~0 < merge_~n); 5886#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 5872#L12-2 [2018-12-08 10:41:12,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:12,337 INFO L82 PathProgramCache]: Analyzing trace with hash -817472459, now seen corresponding path program 1 times [2018-12-08 10:41:12,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:12,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:12,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:12,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:12,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:12,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:12,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 2 times [2018-12-08 10:41:12,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:12,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:12,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:12,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:12,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:12,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash -810276966, now seen corresponding path program 1 times [2018-12-08 10:41:12,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:12,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:12,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:12,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:12,777 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 156 [2018-12-08 10:41:12,987 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-12-08 10:41:13,115 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-12-08 10:41:13,268 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-08 10:41:13,372 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-08 10:41:13,899 WARN L180 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 143 [2018-12-08 10:41:14,113 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-08 10:41:14,114 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:41:14,114 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:41:14,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:41:14,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:41:14,115 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:41:14,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:41:14,115 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:41:14,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:41:14,115 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration13_Lasso [2018-12-08 10:41:14,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:41:14,115 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:41:14,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,522 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 134 [2018-12-08 10:41:14,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:14,849 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2018-12-08 10:41:15,131 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:41:15,131 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:41:15,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:15,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,133 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-12-08 10:41:15,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,134 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-12-08 10:41:15,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,135 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-12-08 10:41:15,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,135 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-12-08 10:41:15,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,136 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-12-08 10:41:15,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,137 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-12-08 10:41:15,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,138 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-12-08 10:41:15,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:41:15,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,140 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-12-08 10:41:15,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,140 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-12-08 10:41:15,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:15,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:15,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,142 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-12-08 10:41:15,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,143 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-12-08 10:41:15,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,144 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-12-08 10:41:15,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,145 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-12-08 10:41:15,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,146 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-12-08 10:41:15,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:15,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:15,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,147 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-12-08 10:41:15,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:15,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:15,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:15,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,148 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-12-08 10:41:15,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:15,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:15,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,150 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-12-08 10:41:15,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:15,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:15,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,153 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-12-08 10:41:15,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:15,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:15,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,155 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-12-08 10:41:15,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:15,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:15,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:15,160 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-12-08 10:41:15,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:15,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:15,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:15,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:15,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:15,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:15,187 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:41:15,201 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-08 10:41:15,201 INFO L444 ModelExtractionUtils]: 68 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 10:41:15,202 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:41:15,202 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:41:15,202 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:41:15,202 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~x~0.offset, merge_sort_merge_~k~0, v_rep(select #length merge_sort_#in~a.base)_4) = -1*merge_sort_merge_~x~0.offset - 4*merge_sort_merge_~k~0 + 1*v_rep(select #length merge_sort_#in~a.base)_4 Supporting invariants [] [2018-12-08 10:41:15,234 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 10:41:15,240 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 10:41:15,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:15,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:15,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:15,348 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2018-12-08 10:41:15,348 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 231 states and 286 transitions. cyclomatic complexity: 75 Second operand 9 states. [2018-12-08 10:41:15,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 231 states and 286 transitions. cyclomatic complexity: 75. Second operand 9 states. Result 284 states and 346 transitions. Complement of second has 23 states. [2018-12-08 10:41:15,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-08 10:41:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-08 10:41:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-12-08 10:41:15,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-08 10:41:15,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:15,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-08 10:41:15,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:15,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 28 letters. Loop has 8 letters. [2018-12-08 10:41:15,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:15,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 346 transitions. [2018-12-08 10:41:15,505 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 80 [2018-12-08 10:41:15,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 280 states and 342 transitions. [2018-12-08 10:41:15,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2018-12-08 10:41:15,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2018-12-08 10:41:15,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 280 states and 342 transitions. [2018-12-08 10:41:15,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:15,507 INFO L705 BuchiCegarLoop]: Abstraction has 280 states and 342 transitions. [2018-12-08 10:41:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states and 342 transitions. [2018-12-08 10:41:15,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 247. [2018-12-08 10:41:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-08 10:41:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 308 transitions. [2018-12-08 10:41:15,511 INFO L728 BuchiCegarLoop]: Abstraction has 247 states and 308 transitions. [2018-12-08 10:41:15,511 INFO L608 BuchiCegarLoop]: Abstraction has 247 states and 308 transitions. [2018-12-08 10:41:15,511 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-08 10:41:15,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 247 states and 308 transitions. [2018-12-08 10:41:15,512 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 80 [2018-12-08 10:41:15,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:15,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:15,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:15,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 10:41:15,513 INFO L794 eck$LassoCheckResult]: Stem: 6452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6429#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 6430#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 6405#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 6406#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6407#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 6408#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6409#L40-3 assume !(main_~i~1 < main_~n~0); 6403#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 6500#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6498#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6492#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6495#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6513#L24 assume ~n < 2; 6512#L8 assume true; 6491#merge_sortEXIT >#86#return; 6477#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6478#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6488#L24 assume ~n < 2; 6479#L8 assume true; 6480#merge_sortEXIT >#88#return; 6476#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 6618#L11-3 assume !!(merge_~k~0 < merge_~n); 6617#L12 assume !(merge_~j~0 == merge_~n); 6616#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 6614#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 6613#L14-2 merge_#t~ite14 := merge_#t~ite13; 6612#L13-2 merge_#t~ite15 := merge_#t~ite14; 6485#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 6445#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6565#L11-3 assume !(merge_~k~0 < merge_~n); 6560#L11-4 merge_~i~0 := 0; 6400#L17-3 [2018-12-08 10:41:15,513 INFO L796 eck$LassoCheckResult]: Loop: 6400#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 6404#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 6400#L17-3 [2018-12-08 10:41:15,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:15,514 INFO L82 PathProgramCache]: Analyzing trace with hash -810277004, now seen corresponding path program 1 times [2018-12-08 10:41:15,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:15,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:15,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:15,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:15,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 10:41:15,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:41:15,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:41:15,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:15,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 10:41:15,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:41:15,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-08 10:41:15,599 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 10:41:15,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:15,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2018-12-08 10:41:15,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:15,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:15,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:15,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:15,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:15,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:41:15,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:41:15,625 INFO L87 Difference]: Start difference. First operand 247 states and 308 transitions. cyclomatic complexity: 83 Second operand 7 states. [2018-12-08 10:41:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:15,655 INFO L93 Difference]: Finished difference Result 412 states and 492 transitions. [2018-12-08 10:41:15,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:41:15,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 492 transitions. [2018-12-08 10:41:15,657 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 80 [2018-12-08 10:41:15,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 402 states and 480 transitions. [2018-12-08 10:41:15,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2018-12-08 10:41:15,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2018-12-08 10:41:15,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 480 transitions. [2018-12-08 10:41:15,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:15,658 INFO L705 BuchiCegarLoop]: Abstraction has 402 states and 480 transitions. [2018-12-08 10:41:15,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 480 transitions. [2018-12-08 10:41:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2018-12-08 10:41:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-08 10:41:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 353 transitions. [2018-12-08 10:41:15,662 INFO L728 BuchiCegarLoop]: Abstraction has 292 states and 353 transitions. [2018-12-08 10:41:15,662 INFO L608 BuchiCegarLoop]: Abstraction has 292 states and 353 transitions. [2018-12-08 10:41:15,662 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-08 10:41:15,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 353 transitions. [2018-12-08 10:41:15,663 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 80 [2018-12-08 10:41:15,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:15,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:15,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:15,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 10:41:15,664 INFO L794 eck$LassoCheckResult]: Stem: 7217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7198#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 7199#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 7173#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 7174#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7175#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 7176#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7177#L40-3 assume !(main_~i~1 < main_~n~0); 7169#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 7203#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7280#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 7277#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 7278#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7281#L24 assume ~n < 2; 7279#L8 assume true; 7276#merge_sortEXIT >#86#return; 7265#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 7266#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7284#L24 assume ~n < 2; 7267#L8 assume true; 7268#merge_sortEXIT >#88#return; 7262#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 7261#L11-3 assume !!(merge_~k~0 < merge_~n); 7260#L12 assume !(merge_~j~0 == merge_~n); 7210#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 7411#L14 assume !(merge_#t~mem7 < merge_#t~mem8);merge_#t~post11 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post11;call merge_#t~mem12 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post11, 4);merge_#t~ite13 := merge_#t~mem12; 7410#L14-2 merge_#t~ite14 := merge_#t~ite13; 7409#L13-2 merge_#t~ite15 := merge_#t~ite14; 7408#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 7220#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7221#L11-3 assume !!(merge_~k~0 < merge_~n); 7209#L12 assume !(merge_~j~0 == merge_~n); 7211#L13 assume merge_~i~0 == merge_~m;merge_#t~post5 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post5;call merge_#t~mem6 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post5, 4);merge_#t~ite14 := merge_#t~mem6; 7412#L13-2 merge_#t~ite15 := merge_#t~ite14; 7413#L12-2 [2018-12-08 10:41:15,664 INFO L796 eck$LassoCheckResult]: Loop: 7413#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 7247#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7248#L11-3 assume !!(merge_~k~0 < merge_~n); 7414#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 7413#L12-2 [2018-12-08 10:41:15,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash -607022711, now seen corresponding path program 1 times [2018-12-08 10:41:15,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:15,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:15,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:15,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:15,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:15,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:15,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 3 times [2018-12-08 10:41:15,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:15,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:15,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:15,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:15,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:15,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:15,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1908632850, now seen corresponding path program 1 times [2018-12-08 10:41:15,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:15,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:15,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:15,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:15,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 10:41:15,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:41:15,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:41:15,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:15,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 10:41:15,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:41:15,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-12-08 10:41:15,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 10:41:15,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-12-08 10:41:15,886 INFO L87 Difference]: Start difference. First operand 292 states and 353 transitions. cyclomatic complexity: 83 Second operand 20 states. [2018-12-08 10:41:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:16,168 INFO L93 Difference]: Finished difference Result 348 states and 405 transitions. [2018-12-08 10:41:16,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 10:41:16,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 348 states and 405 transitions. [2018-12-08 10:41:16,171 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 38 [2018-12-08 10:41:16,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 348 states to 330 states and 387 transitions. [2018-12-08 10:41:16,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 293 [2018-12-08 10:41:16,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2018-12-08 10:41:16,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 387 transitions. [2018-12-08 10:41:16,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:16,174 INFO L705 BuchiCegarLoop]: Abstraction has 330 states and 387 transitions. [2018-12-08 10:41:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 387 transitions. [2018-12-08 10:41:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 288. [2018-12-08 10:41:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-12-08 10:41:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 341 transitions. [2018-12-08 10:41:16,180 INFO L728 BuchiCegarLoop]: Abstraction has 288 states and 341 transitions. [2018-12-08 10:41:16,180 INFO L608 BuchiCegarLoop]: Abstraction has 288 states and 341 transitions. [2018-12-08 10:41:16,180 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-08 10:41:16,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 341 transitions. [2018-12-08 10:41:16,181 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 36 [2018-12-08 10:41:16,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:16,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:16,182 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:16,182 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 10:41:16,182 INFO L794 eck$LassoCheckResult]: Stem: 8005#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7988#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 7989#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 7969#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 7970#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7971#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 7972#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8022#L40-3 assume !(main_~i~1 < main_~n~0); 7966#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 7993#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8024#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8047#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8049#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8147#L24 assume ~n < 2; 8146#L8 assume true; 8046#merge_sortEXIT >#86#return; 8048#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8143#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8145#L24 assume ~n < 2; 8144#L8 assume true; 8142#merge_sortEXIT >#88#return; 8064#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 8141#L11-3 assume !!(merge_~k~0 < merge_~n); 8139#L12 assume !(merge_~j~0 == merge_~n); 8138#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 8137#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 8136#L14-2 merge_#t~ite14 := merge_#t~ite13; 8135#L13-2 merge_#t~ite15 := merge_#t~ite14; 8134#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 8133#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8132#L11-3 assume !!(merge_~k~0 < merge_~n); 8131#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 8107#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 8106#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8103#L11-3 assume !(merge_~k~0 < merge_~n); 8006#L11-4 merge_~i~0 := 0; 7964#L17-3 [2018-12-08 10:41:16,182 INFO L796 eck$LassoCheckResult]: Loop: 7964#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 7968#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 7964#L17-3 [2018-12-08 10:41:16,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash 64206937, now seen corresponding path program 1 times [2018-12-08 10:41:16,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:16,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:16,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:16,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:16,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2018-12-08 10:41:16,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:16,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:16,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:16,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:16,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:16,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:16,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1573325915, now seen corresponding path program 1 times [2018-12-08 10:41:16,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:16,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:16,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:16,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:16,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:16,863 WARN L180 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 196 [2018-12-08 10:41:17,139 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2018-12-08 10:41:17,694 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2018-12-08 10:41:17,816 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-08 10:41:17,817 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:41:17,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:41:17,818 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:41:17,818 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:41:17,818 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:41:17,818 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:41:17,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:41:17,818 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:41:17,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration16_Lasso [2018-12-08 10:41:17,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:41:17,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:41:17,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:17,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:18,164 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 123 [2018-12-08 10:41:18,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:18,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:18,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:18,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:18,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:18,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:18,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:18,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:18,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:18,605 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:41:18,605 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:41:18,606 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-12-08 10:41:18,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,607 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-12-08 10:41:18,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,608 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-12-08 10:41:18,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,609 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-12-08 10:41:18,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,610 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-12-08 10:41:18,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,610 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-12-08 10:41:18,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,611 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-12-08 10:41:18,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,612 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-12-08 10:41:18,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,613 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-12-08 10:41:18,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,614 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-12-08 10:41:18,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,615 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-12-08 10:41:18,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,616 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-12-08 10:41:18,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,617 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-12-08 10:41:18,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,618 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-12-08 10:41:18,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,619 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-12-08 10:41:18,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,619 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-12-08 10:41:18,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,620 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-12-08 10:41:18,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,621 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-12-08 10:41:18,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,622 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-12-08 10:41:18,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,623 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-12-08 10:41:18,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,624 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-12-08 10:41:18,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,626 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-12-08 10:41:18,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:41:18,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:41:18,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:41:18,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,626 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-12-08 10:41:18,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,628 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-12-08 10:41:18,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,628 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:41:18,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,628 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:41:18,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,630 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-12-08 10:41:18,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,631 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-12-08 10:41:18,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,634 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-12-08 10:41:18,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,635 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-12-08 10:41:18,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,638 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-12-08 10:41:18,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,640 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-12-08 10:41:18,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,642 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-12-08 10:41:18,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,645 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-12-08 10:41:18,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,645 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:41:18,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,645 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:41:18,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,647 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-12-08 10:41:18,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:41:18,649 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-12-08 10:41:18,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:41:18,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:41:18,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:41:18,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:41:18,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:41:18,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:41:18,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:41:18,679 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 10:41:18,679 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 10:41:18,680 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:41:18,680 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:41:18,681 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:41:18,681 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0, merge_sort_merge_~n) = -1*merge_sort_merge_~i~0 + 1*merge_sort_merge_~n Supporting invariants [] [2018-12-08 10:41:18,723 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-12-08 10:41:18,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:18,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:18,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:41:18,768 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 10:41:18,768 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 288 states and 341 transitions. cyclomatic complexity: 63 Second operand 4 states. [2018-12-08 10:41:18,797 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 288 states and 341 transitions. cyclomatic complexity: 63. Second operand 4 states. Result 300 states and 360 transitions. Complement of second has 12 states. [2018-12-08 10:41:18,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 10:41:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 10:41:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-12-08 10:41:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 2 letters. [2018-12-08 10:41:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 38 letters. Loop has 2 letters. [2018-12-08 10:41:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 4 letters. [2018-12-08 10:41:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:41:18,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 360 transitions. [2018-12-08 10:41:18,800 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2018-12-08 10:41:18,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 248 states and 297 transitions. [2018-12-08 10:41:18,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2018-12-08 10:41:18,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2018-12-08 10:41:18,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 297 transitions. [2018-12-08 10:41:18,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:18,802 INFO L705 BuchiCegarLoop]: Abstraction has 248 states and 297 transitions. [2018-12-08 10:41:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 297 transitions. [2018-12-08 10:41:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-12-08 10:41:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-08 10:41:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 297 transitions. [2018-12-08 10:41:18,805 INFO L728 BuchiCegarLoop]: Abstraction has 248 states and 297 transitions. [2018-12-08 10:41:18,805 INFO L608 BuchiCegarLoop]: Abstraction has 248 states and 297 transitions. [2018-12-08 10:41:18,805 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-08 10:41:18,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 297 transitions. [2018-12-08 10:41:18,806 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2018-12-08 10:41:18,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:18,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:18,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:18,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:18,807 INFO L794 eck$LassoCheckResult]: Stem: 8814#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8796#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 8797#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 8775#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8776#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8777#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8778#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8825#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8779#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8780#L40-3 assume !(main_~i~1 < main_~n~0); 8804#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 8805#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8879#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8874#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8877#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8820#L24 assume ~n < 2; 8876#L8 assume true; 8873#merge_sortEXIT >#86#return; 8771#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8867#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8885#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8881#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8882#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8884#L24 assume ~n < 2; 8883#L8 assume true; 8880#merge_sortEXIT >#86#return; 8869#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8870#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8878#L24 assume ~n < 2; 8875#L8 assume true; 8868#merge_sortEXIT >#88#return; 8864#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 8862#L11-3 assume !!(merge_~k~0 < merge_~n); 8860#L12 assume !(merge_~j~0 == merge_~n); 8851#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 8852#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 8844#L14-2 merge_#t~ite14 := merge_#t~ite13; 8842#L13-2 merge_#t~ite15 := merge_#t~ite14; 8840#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 8838#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8834#L11-3 assume !!(merge_~k~0 < merge_~n); 8832#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 8831#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 8828#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8827#L11-3 assume !(merge_~k~0 < merge_~n); 8826#L11-4 merge_~i~0 := 0; 8824#L17-3 assume !(merge_~i~0 < merge_~n); 8773#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 8798#L8 assume true; 8799#merge_sortEXIT >#88#return; 8812#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 8999#L11-3 assume !!(merge_~k~0 < merge_~n); 8997#L12 assume !(merge_~j~0 == merge_~n); 8995#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 8993#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 8992#L14-2 merge_#t~ite14 := merge_#t~ite13; 8991#L13-2 merge_#t~ite15 := merge_#t~ite14; 8990#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 8989#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8980#L11-3 assume !!(merge_~k~0 < merge_~n); 8973#L12 [2018-12-08 10:41:18,807 INFO L796 eck$LassoCheckResult]: Loop: 8973#L12 assume !(merge_~j~0 == merge_~n); 8975#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 9007#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 9005#L14-2 merge_#t~ite14 := merge_#t~ite13; 8976#L13-2 merge_#t~ite15 := merge_#t~ite14; 8977#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 8969#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8970#L11-3 assume !!(merge_~k~0 < merge_~n); 8973#L12 [2018-12-08 10:41:18,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1719261906, now seen corresponding path program 1 times [2018-12-08 10:41:18,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:18,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:18,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-08 10:41:18,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:41:18,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:41:18,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:18,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 10:41:19,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:41:19,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-12-08 10:41:19,005 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 10:41:19,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2018-12-08 10:41:19,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:19,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:19,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:19,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:19,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:19,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 10:41:19,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-12-08 10:41:19,131 INFO L87 Difference]: Start difference. First operand 248 states and 297 transitions. cyclomatic complexity: 58 Second operand 20 states. [2018-12-08 10:41:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:19,596 INFO L93 Difference]: Finished difference Result 407 states and 488 transitions. [2018-12-08 10:41:19,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-08 10:41:19,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 407 states and 488 transitions. [2018-12-08 10:41:19,598 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 98 [2018-12-08 10:41:19,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 407 states to 401 states and 482 transitions. [2018-12-08 10:41:19,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 382 [2018-12-08 10:41:19,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 382 [2018-12-08 10:41:19,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 482 transitions. [2018-12-08 10:41:19,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:19,600 INFO L705 BuchiCegarLoop]: Abstraction has 401 states and 482 transitions. [2018-12-08 10:41:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 482 transitions. [2018-12-08 10:41:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 315. [2018-12-08 10:41:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-08 10:41:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 377 transitions. [2018-12-08 10:41:19,604 INFO L728 BuchiCegarLoop]: Abstraction has 315 states and 377 transitions. [2018-12-08 10:41:19,604 INFO L608 BuchiCegarLoop]: Abstraction has 315 states and 377 transitions. [2018-12-08 10:41:19,604 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-08 10:41:19,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 377 transitions. [2018-12-08 10:41:19,605 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 52 [2018-12-08 10:41:19,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:19,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:19,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:19,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:19,606 INFO L794 eck$LassoCheckResult]: Stem: 9707#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9689#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 9690#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 9671#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 9672#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9673#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 9674#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9723#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 9719#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9720#L40-3 assume !(main_~i~1 < main_~n~0); 9665#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 9697#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9791#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9786#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9789#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9716#L24 assume ~n < 2; 9788#L8 assume true; 9785#merge_sortEXIT >#86#return; 9667#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 9778#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9797#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9793#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9794#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9796#L24 assume ~n < 2; 9795#L8 assume true; 9792#merge_sortEXIT >#86#return; 9781#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 9782#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9790#L24 assume ~n < 2; 9787#L8 assume true; 9780#merge_sortEXIT >#88#return; 9776#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 9774#L11-3 assume !!(merge_~k~0 < merge_~n); 9772#L12 assume !(merge_~j~0 == merge_~n); 9763#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 9764#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 9755#L14-2 merge_#t~ite14 := merge_#t~ite13; 9756#L13-2 merge_#t~ite15 := merge_#t~ite14; 9747#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 9748#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 9736#L11-3 assume !!(merge_~k~0 < merge_~n); 9737#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 9731#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 9732#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 9727#L11-3 assume !(merge_~k~0 < merge_~n); 9728#L11-4 merge_~i~0 := 0; 9724#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 9670#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 9666#L17-3 assume !(merge_~i~0 < merge_~n); 9669#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 9691#L8 assume true; 9692#merge_sortEXIT >#88#return; 9693#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 9694#L11-3 assume !!(merge_~k~0 < merge_~n); 9940#L12 assume !(merge_~j~0 == merge_~n); 9939#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 9937#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 9938#L14-2 merge_#t~ite14 := merge_#t~ite13; 9972#L13-2 merge_#t~ite15 := merge_#t~ite14; 9964#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 9945#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 9943#L11-3 assume !!(merge_~k~0 < merge_~n); 9941#L12 [2018-12-08 10:41:19,606 INFO L796 eck$LassoCheckResult]: Loop: 9941#L12 assume !(merge_~j~0 == merge_~n); 9682#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 9683#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 9702#L14-2 merge_#t~ite14 := merge_#t~ite13; 9687#L13-2 merge_#t~ite15 := merge_#t~ite14; 9688#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 9703#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 9706#L11-3 assume !!(merge_~k~0 < merge_~n); 9941#L12 [2018-12-08 10:41:19,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2004988308, now seen corresponding path program 1 times [2018-12-08 10:41:19,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:19,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:19,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:19,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:19,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-08 10:41:19,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:41:19,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f13978-c0a8-4ea2-b929-4c36e4d66db7/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:41:19,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:41:19,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:41:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 10:41:19,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:41:19,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-12-08 10:41:19,791 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 10:41:19,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:19,791 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2018-12-08 10:41:19,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:19,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:19,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:19,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:41:19,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:19,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 10:41:19,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-08 10:41:19,881 INFO L87 Difference]: Start difference. First operand 315 states and 377 transitions. cyclomatic complexity: 73 Second operand 21 states. [2018-12-08 10:41:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:41:20,558 INFO L93 Difference]: Finished difference Result 556 states and 672 transitions. [2018-12-08 10:41:20,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-08 10:41:20,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 556 states and 672 transitions. [2018-12-08 10:41:20,560 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 168 [2018-12-08 10:41:20,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 556 states to 556 states and 672 transitions. [2018-12-08 10:41:20,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 533 [2018-12-08 10:41:20,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 533 [2018-12-08 10:41:20,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 556 states and 672 transitions. [2018-12-08 10:41:20,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:41:20,563 INFO L705 BuchiCegarLoop]: Abstraction has 556 states and 672 transitions. [2018-12-08 10:41:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states and 672 transitions. [2018-12-08 10:41:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 325. [2018-12-08 10:41:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-08 10:41:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 387 transitions. [2018-12-08 10:41:20,567 INFO L728 BuchiCegarLoop]: Abstraction has 325 states and 387 transitions. [2018-12-08 10:41:20,567 INFO L608 BuchiCegarLoop]: Abstraction has 325 states and 387 transitions. [2018-12-08 10:41:20,567 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-08 10:41:20,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 325 states and 387 transitions. [2018-12-08 10:41:20,568 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 52 [2018-12-08 10:41:20,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:41:20,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:41:20,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:20,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:41:20,568 INFO L794 eck$LassoCheckResult]: Stem: 10833#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10818#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 10819#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 10801#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 10802#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10803#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 10804#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10805#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 10848#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10847#L40-3 assume !(main_~i~1 < main_~n~0); 10794#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 10824#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10865#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 10842#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 10843#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10840#L24 assume ~n < 2; 10927#L8 assume true; 10924#merge_sortEXIT >#86#return; 10798#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 10851#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10849#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 10850#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 10859#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10954#L24 assume ~n < 2; 10876#L8 assume true; 10858#merge_sortEXIT >#86#return; 10807#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 10837#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10806#L24 assume ~n < 2; 10808#L8 assume true; 10986#merge_sortEXIT >#88#return; 10985#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 10984#L11-3 assume !!(merge_~k~0 < merge_~n); 10983#L12 assume !(merge_~j~0 == merge_~n); 10982#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 10980#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 10979#L14-2 merge_#t~ite14 := merge_#t~ite13; 10978#L13-2 merge_#t~ite15 := merge_#t~ite14; 10977#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 10976#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10975#L11-3 assume !!(merge_~k~0 < merge_~n); 10974#L12 assume merge_~j~0 == merge_~n;merge_#t~post3 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post3;call merge_#t~mem4 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post3, 4);merge_#t~ite15 := merge_#t~mem4; 10971#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 10969#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10967#L11-3 assume !(merge_~k~0 < merge_~n); 10964#L11-4 merge_~i~0 := 0; 10962#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 10823#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 10797#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 10800#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 10952#L17-3 assume !(merge_~i~0 < merge_~n); 10953#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 11015#L8 assume true; 10830#merge_sortEXIT >#88#return; 10821#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 10822#L11-3 assume !!(merge_~k~0 < merge_~n); 11082#L12 assume !(merge_~j~0 == merge_~n); 11081#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 11079#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 11080#L14-2 merge_#t~ite14 := merge_#t~ite13; 11110#L13-2 merge_#t~ite15 := merge_#t~ite14; 11109#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 11108#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10835#L11-3 assume !!(merge_~k~0 < merge_~n); 10836#L12 [2018-12-08 10:41:20,568 INFO L796 eck$LassoCheckResult]: Loop: 10836#L12 assume !(merge_~j~0 == merge_~n); 10811#L13 assume !(merge_~i~0 == merge_~m);call merge_#t~mem7 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~j~0, 4);call merge_#t~mem8 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4); 10812#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 10825#L14-2 merge_#t~ite14 := merge_#t~ite13; 10816#L13-2 merge_#t~ite15 := merge_#t~ite14; 10817#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem12;havoc merge_#t~mem8;havoc merge_#t~post11;havoc merge_#t~post9;havoc merge_#t~post3;havoc merge_#t~mem6;havoc merge_#t~ite13;havoc merge_#t~ite14;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~mem10;havoc merge_#t~ite15;havoc merge_#t~post5; 10829#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10832#L11-3 assume !!(merge_~k~0 < merge_~n); 10836#L12 [2018-12-08 10:41:20,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:20,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1710153686, now seen corresponding path program 2 times [2018-12-08 10:41:20,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:20,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:20,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:20,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:20,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:20,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:20,597 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 4 times [2018-12-08 10:41:20,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:20,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:20,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:20,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:20,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:20,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:41:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1618831734, now seen corresponding path program 3 times [2018-12-08 10:41:20,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:41:20,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:41:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:20,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:41:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:41:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:41:21,922 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 265 DAG size of output: 222 [2018-12-08 10:41:22,346 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2018-12-08 10:41:22,567 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-08 10:41:22,742 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-08 10:41:24,233 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 267 DAG size of output: 234 [2018-12-08 10:41:24,555 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-12-08 10:41:24,696 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2018-12-08 10:41:25,101 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-08 10:41:25,589 WARN L180 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-08 10:41:27,294 WARN L180 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 192 DAG size of output: 186 [2018-12-08 10:41:28,134 WARN L180 SmtUtils]: Spent 838.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2018-12-08 10:41:28,137 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:41:28,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:41:28,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:41:28,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:41:28,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:41:28,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:41:28,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:41:28,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:41:28,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration19_Lasso [2018-12-08 10:41:28,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:41:28,137 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:41:28,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:28,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:28,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:28,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:28,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:41:28,543 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-08 10:41:28,545 INFO L168 Benchmark]: Toolchain (without parser) took 27443.15 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 807.9 MB). Free memory was 962.4 MB in the beginning and 1.5 GB in the end (delta: -574.0 MB). Peak memory consumption was 967.8 MB. Max. memory is 11.5 GB. [2018-12-08 10:41:28,546 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:41:28,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.67 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 950.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-08 10:41:28,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-08 10:41:28,546 INFO L168 Benchmark]: Boogie Preprocessor took 18.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 10:41:28,547 INFO L168 Benchmark]: RCFGBuilder took 199.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-12-08 10:41:28,547 INFO L168 Benchmark]: BuchiAutomizer took 27028.74 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 674.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -429.0 MB). Peak memory consumption was 979.0 MB. Max. memory is 11.5 GB. [2018-12-08 10:41:28,549 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.67 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 950.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27028.74 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 674.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -429.0 MB). Peak memory consumption was 979.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...