./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/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_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/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_f2962b64-df87-4a3d-8fa3-82573c67efe7/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-0cd3be1 [2018-11-28 11:32:55,997 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:32:55,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:32:56,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:32:56,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:32:56,010 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:32:56,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:32:56,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:32:56,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:32:56,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:32:56,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:32:56,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:32:56,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:32:56,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:32:56,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:32:56,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:32:56,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:32:56,021 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:32:56,023 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:32:56,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:32:56,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:32:56,026 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:32:56,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:32:56,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:32:56,028 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:32:56,029 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:32:56,030 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:32:56,031 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:32:56,031 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:32:56,032 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:32:56,032 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:32:56,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:32:56,033 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:32:56,033 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:32:56,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:32:56,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:32:56,035 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:32:56,049 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:32:56,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:32:56,050 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:32:56,050 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:32:56,051 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:32:56,051 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:32:56,051 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:32:56,051 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:32:56,051 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:32:56,052 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:32:56,052 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:32:56,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:32:56,052 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:32:56,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:32:56,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:32:56,053 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:32:56,053 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:32:56,053 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:32:56,053 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:32:56,053 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:32:56,054 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:32:56,054 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:32:56,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:32:56,054 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:32:56,054 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:32:56,054 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:32:56,055 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:32:56,055 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:32:56,056 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:32:56,056 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_f2962b64-df87-4a3d-8fa3-82573c67efe7/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-11-28 11:32:56,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:32:56,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:32:56,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:32:56,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:32:56,096 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:32:56,097 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-11-28 11:32:56,144 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/data/fd615b4e8/20d1d268f2e5415a94bc82ad8bdffa2b/FLAGfde387632 [2018-11-28 11:32:56,506 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:32:56,507 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-11-28 11:32:56,512 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/data/fd615b4e8/20d1d268f2e5415a94bc82ad8bdffa2b/FLAGfde387632 [2018-11-28 11:32:56,524 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/data/fd615b4e8/20d1d268f2e5415a94bc82ad8bdffa2b [2018-11-28 11:32:56,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:32:56,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:32:56,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:32:56,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:32:56,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:32:56,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0bf2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56, skipping insertion in model container [2018-11-28 11:32:56,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:32:56,553 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:32:56,668 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:32:56,678 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:32:56,694 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:32:56,710 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:32:56,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56 WrapperNode [2018-11-28 11:32:56,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:32:56,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:32:56,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:32:56,712 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:32:56,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:32:56,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:32:56,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:32:56,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:32:56,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (1/1) ... [2018-11-28 11:32:56,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:32:56,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:32:56,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:32:56,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:32:56,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:32:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:32:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2018-11-28 11:32:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2018-11-28 11:32:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:32:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:32:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:32:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:32:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:32:57,077 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:32:57,077 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 11:32:57,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:32:57 BoogieIcfgContainer [2018-11-28 11:32:57,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:32:57,078 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:32:57,078 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:32:57,083 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:32:57,084 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:32:57,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:32:56" (1/3) ... [2018-11-28 11:32:57,085 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5431f4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:32:57, skipping insertion in model container [2018-11-28 11:32:57,085 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:32:57,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:56" (2/3) ... [2018-11-28 11:32:57,086 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5431f4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:32:57, skipping insertion in model container [2018-11-28 11:32:57,086 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:32:57,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:32:57" (3/3) ... [2018-11-28 11:32:57,088 INFO L375 chiAutomizerObserver]: Analyzing ICFG mergeSort_true-termination.c.i [2018-11-28 11:32:57,132 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:32:57,133 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:32:57,133 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:32:57,133 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:32:57,133 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:32:57,133 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:32:57,133 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:32:57,133 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:32:57,133 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:32:57,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-28 11:32:57,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-28 11:32:57,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:32:57,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:32:57,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:32:57,173 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:32:57,173 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:32:57,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-28 11:32:57,176 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-28 11:32:57,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:32:57,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:32:57,177 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:32:57,177 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:32:57,183 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-11-28 11:32:57,183 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-11-28 11:32:57,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash 88447, now seen corresponding path program 1 times [2018-11-28 11:32:57,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:57,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:57,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:57,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2018-11-28 11:32:57,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:57,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:57,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:57,297 INFO L82 PathProgramCache]: Analyzing trace with hash 84999937, now seen corresponding path program 1 times [2018-11-28 11:32:57,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:57,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:57,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:57,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:57,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:57,483 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:32:57,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:32:57,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:32:57,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:32:57,484 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:32:57,484 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:32:57,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:32:57,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:32:57,485 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration1_Lasso [2018-11-28 11:32:57,485 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:32:57,485 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:32:57,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:57,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:57,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:57,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:57,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:57,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:57,771 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:32:57,775 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:32:57,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:57,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:57,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:57,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:57,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:57,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:57,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:57,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:57,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:57,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:57,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:57,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:57,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:57,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:57,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:57,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:57,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:57,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:57,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:57,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:57,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:57,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:57,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:57,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:32:57,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:32:57,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:57,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:57,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:57,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:57,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:57,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:57,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:57,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:57,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:57,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:57,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:57,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:57,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:57,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:57,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:57,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:32:57,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:32:57,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:57,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:57,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:57,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:57,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:57,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:57,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:57,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:57,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:57,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:57,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:57,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:57,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:57,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:57,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:57,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:32:57,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:32:57,866 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:32:57,893 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:32:57,893 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 11:32:57,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:32:57,897 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:32:57,897 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:32:57,897 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-11-28 11:32:57,917 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 11:32:57,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:32:57,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:57,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:32:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:57,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:32:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:32:58,005 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:32:58,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 3 states. [2018-11-28 11:32:58,056 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-11-28 11:32:58,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:32:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:32:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-28 11:32:58,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 11:32:58,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:32:58,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 11:32:58,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:32:58,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 11:32:58,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:32:58,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2018-11-28 11:32:58,065 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 11:32:58,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 26 states and 37 transitions. [2018-11-28 11:32:58,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 11:32:58,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 11:32:58,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2018-11-28 11:32:58,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:32:58,072 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-28 11:32:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2018-11-28 11:32:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 11:32:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 11:32:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-11-28 11:32:58,090 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-28 11:32:58,090 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-28 11:32:58,091 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:32:58,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2018-11-28 11:32:58,091 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 11:32:58,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:32:58,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:32:58,092 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:32:58,092 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:32:58,092 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-11-28 11:32:58,092 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-11-28 11:32:58,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:58,093 INFO L82 PathProgramCache]: Analyzing trace with hash 84999888, now seen corresponding path program 1 times [2018-11-28 11:32:58,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:58,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:58,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:58,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:32:58,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:32:58,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:32:58,123 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:32:58,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2018-11-28 11:32:58,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:58,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:58,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:58,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:32:58,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:32:58,256 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-28 11:32:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:32:58,267 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2018-11-28 11:32:58,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:32:58,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-11-28 11:32:58,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 11:32:58,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2018-11-28 11:32:58,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 11:32:58,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 11:32:58,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-28 11:32:58,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:32:58,270 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 11:32:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-28 11:32:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 11:32:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 11:32:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-11-28 11:32:58,272 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-28 11:32:58,272 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-28 11:32:58,272 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:32:58,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2018-11-28 11:32:58,273 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 11:32:58,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:32:58,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:32:58,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:32:58,274 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:32:58,274 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-11-28 11:32:58,274 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-11-28 11:32:58,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash 80563154, now seen corresponding path program 1 times [2018-11-28 11:32:58,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:58,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:58,288 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 2 times [2018-11-28 11:32:58,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:58,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:58,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:58,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:58,297 INFO L82 PathProgramCache]: Analyzing trace with hash -829797441, now seen corresponding path program 1 times [2018-11-28 11:32:58,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:58,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:58,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:32:58,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:32:58,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:32:58,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:32:58,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:58,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:32:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:32:58,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:32:58,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 11:32:58,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:32:58,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:32:58,542 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-28 11:32:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:32:58,596 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-28 11:32:58,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:32:58,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2018-11-28 11:32:58,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 11:32:58,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2018-11-28 11:32:58,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 11:32:58,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 11:32:58,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-11-28 11:32:58,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:32:58,600 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-28 11:32:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-11-28 11:32:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-28 11:32:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 11:32:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-28 11:32:58,602 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-28 11:32:58,602 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-28 11:32:58,603 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:32:58,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-28 11:32:58,603 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 11:32:58,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:32:58,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:32:58,603 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-28 11:32:58,603 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:32:58,604 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-11-28 11:32:58,604 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-11-28 11:32:58,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash 111829076, now seen corresponding path program 2 times [2018-11-28 11:32:58,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:58,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 3 times [2018-11-28 11:32:58,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:58,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:58,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:32:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:58,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1394618371, now seen corresponding path program 2 times [2018-11-28 11:32:58,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:58,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:58,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:32:58,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:32:59,010 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:32:59,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:32:59,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:32:59,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:32:59,011 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:32:59,011 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:32:59,011 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:32:59,011 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:32:59,011 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration4_Lasso [2018-11-28 11:32:59,011 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:32:59,011 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:32:59,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-11-28 11:32:59,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,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-11-28 11:32:59,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,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-11-28 11:32:59,294 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:32:59,294 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:32:59,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,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-11-28 11:32:59,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,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-11-28 11:32:59,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,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-11-28 11:32:59,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,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-11-28 11:32:59,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,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-11-28 11:32:59,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:32:59,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:32:59,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:32:59,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:32:59,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:32:59,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:32:59,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:32:59,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,395 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:32:59,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,396 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:32:59,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:32:59,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:32:59,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:32:59,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:32:59,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:32:59,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:32:59,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:32:59,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:32:59,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:32:59,416 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:32:59,423 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:32:59,423 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:32:59,423 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:32:59,424 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:32:59,424 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:32:59,424 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2018-11-28 11:32:59,441 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 11:32:59,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:59,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:32:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:59,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:32:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:32:59,607 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-11-28 11:32:59,607 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-28 11:33:01,316 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-11-28 11:33:01,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:33:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:33:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-28 11:33:01,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 11:33:01,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:01,320 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:33:01,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:01,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:01,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:33:01,380 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-11-28 11:33:01,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-28 11:33:01,437 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-11-28 11:33:01,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:33:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:33:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 11:33:01,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 11:33:01,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:01,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 11:33:01,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:01,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 11:33:01,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:01,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-11-28 11:33:01,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 11:33:01,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 49 transitions. [2018-11-28 11:33:01,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 11:33:01,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 11:33:01,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2018-11-28 11:33:01,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:01,442 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-11-28 11:33:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2018-11-28 11:33:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-28 11:33:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 11:33:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-11-28 11:33:01,445 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-28 11:33:01,445 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-28 11:33:01,445 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:33:01,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2018-11-28 11:33:01,446 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 11:33:01,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:01,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:01,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:01,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:01,448 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-11-28 11:33:01,448 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-11-28 11:33:01,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:01,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744228, now seen corresponding path program 1 times [2018-11-28 11:33:01,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:01,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:01,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:01,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:01,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:01,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:01,466 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 1 times [2018-11-28 11:33:01,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:01,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:01,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:01,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:01,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:01,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:01,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1064649429, now seen corresponding path program 1 times [2018-11-28 11:33:01,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:01,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:01,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:01,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:01,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:33:01,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:33:01,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:33:01,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:01,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:33:01,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:33:01,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-28 11:33:01,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:33:01,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:33:01,887 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 13 states. [2018-11-28 11:33:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:01,990 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-28 11:33:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:33:01,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2018-11-28 11:33:01,992 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-11-28 11:33:01,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 65 states and 81 transitions. [2018-11-28 11:33:01,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-28 11:33:01,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-28 11:33:01,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2018-11-28 11:33:01,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:01,994 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2018-11-28 11:33:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2018-11-28 11:33:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-28 11:33:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 11:33:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2018-11-28 11:33:01,998 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-11-28 11:33:01,998 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-11-28 11:33:01,999 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:33:01,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2018-11-28 11:33:01,999 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-11-28 11:33:02,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:02,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:02,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:02,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:02,000 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-11-28 11:33:02,000 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-11-28 11:33:02,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 2 times [2018-11-28 11:33:02,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:02,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:02,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:02,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:02,019 INFO L82 PathProgramCache]: Analyzing trace with hash -729398939, now seen corresponding path program 1 times [2018-11-28 11:33:02,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:02,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:02,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:02,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:02,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 11:33:02,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:33:02,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/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-11-28 11:33:02,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:02,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 11:33:02,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:33:02,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-28 11:33:02,099 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:33:02,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:33:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:33:02,099 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-11-28 11:33:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:02,135 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-28 11:33:02,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:33:02,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 102 transitions. [2018-11-28 11:33:02,137 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-11-28 11:33:02,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 102 transitions. [2018-11-28 11:33:02,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-28 11:33:02,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-28 11:33:02,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 102 transitions. [2018-11-28 11:33:02,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:02,139 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 102 transitions. [2018-11-28 11:33:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 102 transitions. [2018-11-28 11:33:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-11-28 11:33:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 11:33:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-11-28 11:33:02,145 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-11-28 11:33:02,145 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-11-28 11:33:02,145 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:33:02,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 82 transitions. [2018-11-28 11:33:02,146 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-11-28 11:33:02,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:02,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:02,146 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:02,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:02,147 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-11-28 11:33:02,147 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-11-28 11:33:02,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:02,147 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 3 times [2018-11-28 11:33:02,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:02,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:02,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:02,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:02,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:02,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:02,161 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 2 times [2018-11-28 11:33:02,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:02,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:02,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:02,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:02,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:02,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:02,168 INFO L82 PathProgramCache]: Analyzing trace with hash -889748845, now seen corresponding path program 2 times [2018-11-28 11:33:02,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:02,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:02,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:02,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:02,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:02,706 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-11-28 11:33:02,887 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:33:02,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:33:02,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:33:02,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:33:02,887 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:33:02,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:33:02,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:33:02,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:33:02,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration7_Lasso [2018-11-28 11:33:02,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:33:02,887 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:33:02,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:02,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33: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-11-28 11:33:03,171 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:33:03,171 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:33:03,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:03,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:03,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:03,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:03,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33: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-11-28 11:33:03,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33: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-11-28 11:33:03,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:03,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:03,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:03,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33: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-11-28 11:33:03,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:03,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:03,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:03,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:03,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:03,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:03,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33: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-11-28 11:33:03,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,247 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:33:03,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,248 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:33:03,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:03,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33: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-11-28 11:33:03,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:03,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:03,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:03,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:03,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:03,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:03,266 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:33:03,296 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:33:03,296 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 11:33:03,297 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:33:03,297 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:33:03,298 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:33:03,298 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-11-28 11:33:03,298 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:33:03,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:03,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:03,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:33:03,476 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-11-28 11:33:03,476 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 82 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-11-28 11:33:03,591 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-11-28 11:33:03,592 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-11-28 11:33:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:33:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2018-11-28 11:33:03,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 8 letters. [2018-11-28 11:33:03,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:03,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 26 letters. Loop has 8 letters. [2018-11-28 11:33:03,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:03,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 16 letters. [2018-11-28 11:33:03,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:03,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 440 transitions. [2018-11-28 11:33:03,600 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2018-11-28 11:33:03,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 237 states and 327 transitions. [2018-11-28 11:33:03,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2018-11-28 11:33:03,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2018-11-28 11:33:03,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 327 transitions. [2018-11-28 11:33:03,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:03,604 INFO L705 BuchiCegarLoop]: Abstraction has 237 states and 327 transitions. [2018-11-28 11:33:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 327 transitions. [2018-11-28 11:33:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 215. [2018-11-28 11:33:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-28 11:33:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 291 transitions. [2018-11-28 11:33:03,620 INFO L728 BuchiCegarLoop]: Abstraction has 215 states and 291 transitions. [2018-11-28 11:33:03,620 INFO L608 BuchiCegarLoop]: Abstraction has 215 states and 291 transitions. [2018-11-28 11:33:03,620 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:33:03,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 291 transitions. [2018-11-28 11:33:03,623 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2018-11-28 11:33:03,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:03,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:03,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:03,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:33:03,624 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-11-28 11:33:03,624 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:03,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 1 times [2018-11-28 11:33:03,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:03,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:03,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:03,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:03,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:03,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1495548, now seen corresponding path program 1 times [2018-11-28 11:33:03,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:03,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:03,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:03,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:03,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1497601855, now seen corresponding path program 1 times [2018-11-28 11:33:03,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:03,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:33:03,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:03,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:33:03,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:33:03,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:33:03,730 INFO L87 Difference]: Start difference. First operand 215 states and 291 transitions. cyclomatic complexity: 100 Second operand 4 states. [2018-11-28 11:33:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:03,758 INFO L93 Difference]: Finished difference Result 328 states and 445 transitions. [2018-11-28 11:33:03,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:33:03,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 328 states and 445 transitions. [2018-11-28 11:33:03,763 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 134 [2018-11-28 11:33:03,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 328 states to 328 states and 445 transitions. [2018-11-28 11:33:03,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-11-28 11:33:03,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-11-28 11:33:03,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 328 states and 445 transitions. [2018-11-28 11:33:03,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:03,767 INFO L705 BuchiCegarLoop]: Abstraction has 328 states and 445 transitions. [2018-11-28 11:33:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 445 transitions. [2018-11-28 11:33:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2018-11-28 11:33:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-28 11:33:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 354 transitions. [2018-11-28 11:33:03,783 INFO L728 BuchiCegarLoop]: Abstraction has 269 states and 354 transitions. [2018-11-28 11:33:03,783 INFO L608 BuchiCegarLoop]: Abstraction has 269 states and 354 transitions. [2018-11-28 11:33:03,784 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 11:33:03,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 354 transitions. [2018-11-28 11:33:03,785 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2018-11-28 11:33:03,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:03,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:03,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:03,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:03,786 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-11-28 11:33:03,786 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:03,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:03,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 2 times [2018-11-28 11:33:03,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:03,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:03,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:03,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:03,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:03,802 INFO L82 PathProgramCache]: Analyzing trace with hash 291245299, now seen corresponding path program 1 times [2018-11-28 11:33:03,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:03,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:03,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:03,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:03,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:03,809 INFO L82 PathProgramCache]: Analyzing trace with hash -800163658, now seen corresponding path program 1 times [2018-11-28 11:33:03,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:03,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:03,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:03,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:03,942 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-11-28 11:33:04,206 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-11-28 11:33:04,349 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-28 11:33:04,629 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2018-11-28 11:33:04,693 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:33:04,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:33:04,693 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:33:04,693 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:33:04,693 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:33:04,693 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:33:04,693 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:33:04,693 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:33:04,693 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration9_Lasso [2018-11-28 11:33:04,693 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:33:04,693 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:33:04,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,879 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2018-11-28 11:33:04,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:04,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:05,131 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-28 11:33:05,411 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-28 11:33:05,478 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:33:05,478 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:33:05,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:05,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:05,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:05,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:05,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:05,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:05,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:05,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:05,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:05,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:05,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:05,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:05,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:05,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:05,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:05,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:05,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:05,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:05,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:05,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:05,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:05,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:05,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:05,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:05,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:05,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:05,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:05,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:05,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:05,483 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:33:05,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:05,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:05,484 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:33:05,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:05,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:05,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:05,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:05,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:05,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:05,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:05,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:05,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:05,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:05,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:05,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:05,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:05,490 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 11:33:05,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:05,524 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-28 11:33:05,525 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 11:33:06,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:33:07,665 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2018-11-28 11:33:07,665 INFO L444 ModelExtractionUtils]: 176 out of 208 variables were initially zero. Simplification set additionally 28 variables to zero. [2018-11-28 11:33:07,666 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:33:07,668 INFO L440 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2018-11-28 11:33:07,668 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:33:07,668 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, v_rep(select #length merge_sort_merge_~x~0.base)_1, merge_sort_merge_~i~0) = -1*merge_sort_merge_~a.offset + 1*v_rep(select #length merge_sort_merge_~x~0.base)_1 - 4*merge_sort_merge_~i~0 Supporting invariants [] [2018-11-28 11:33:07,695 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 11:33:07,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:33:07,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:07,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:07,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:33:07,836 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-11-28 11:33:07,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 269 states and 354 transitions. cyclomatic complexity: 109 Second operand 11 states. [2018-11-28 11:33:08,016 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-11-28 11:33:08,017 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-11-28 11:33:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 11:33:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2018-11-28 11:33:08,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 38 transitions. Stem has 23 letters. Loop has 8 letters. [2018-11-28 11:33:08,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:08,019 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:33:08,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:08,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:08,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:33:08,181 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-11-28 11:33:08,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 269 states and 354 transitions. cyclomatic complexity: 109 Second operand 11 states. [2018-11-28 11:33:08,358 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-11-28 11:33:08,358 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-11-28 11:33:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 11:33:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-28 11:33:08,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 41 transitions. Stem has 23 letters. Loop has 8 letters. [2018-11-28 11:33:08,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:08,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 41 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-28 11:33:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:08,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 41 transitions. Stem has 23 letters. Loop has 16 letters. [2018-11-28 11:33:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:08,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 505 transitions. [2018-11-28 11:33:08,366 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 124 [2018-11-28 11:33:08,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 368 states and 493 transitions. [2018-11-28 11:33:08,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2018-11-28 11:33:08,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2018-11-28 11:33:08,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 493 transitions. [2018-11-28 11:33:08,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:08,371 INFO L705 BuchiCegarLoop]: Abstraction has 368 states and 493 transitions. [2018-11-28 11:33:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 493 transitions. [2018-11-28 11:33:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 301. [2018-11-28 11:33:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-11-28 11:33:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 394 transitions. [2018-11-28 11:33:08,387 INFO L728 BuchiCegarLoop]: Abstraction has 301 states and 394 transitions. [2018-11-28 11:33:08,387 INFO L608 BuchiCegarLoop]: Abstraction has 301 states and 394 transitions. [2018-11-28 11:33:08,387 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 11:33:08,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 394 transitions. [2018-11-28 11:33:08,393 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2018-11-28 11:33:08,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:08,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:08,394 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-11-28 11:33:08,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:33:08,394 INFO L794 eck$LassoCheckResult]: Stem: 3480#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; 3495#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);< 3520#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3517#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3511#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 3513#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3518#L24 assume ~n < 2; 3515#L8 assume true; 3510#merge_sortEXIT >#86#return; 3503#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 3504#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3509#L24 assume ~n < 2; 3505#L8 assume true; 3506#merge_sortEXIT >#88#return; 3502#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); 3497#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; 3432#L13-2 [2018-11-28 11:33:08,394 INFO L796 eck$LassoCheckResult]: Loop: 3432#L13-2 merge_#t~ite15 := merge_#t~ite14; 3701#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 3568#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); 3702#L12 assume !(merge_~j~0 == merge_~n); 3431#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; 3432#L13-2 [2018-11-28 11:33:08,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:08,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1360216135, now seen corresponding path program 1 times [2018-11-28 11:33:08,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:08,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:08,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:08,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:33:08,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:08,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:33:08,443 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:33:08,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1895288687, now seen corresponding path program 1 times [2018-11-28 11:33:08,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:08,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:08,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:08,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:33:08,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:33:08,529 INFO L87 Difference]: Start difference. First operand 301 states and 394 transitions. cyclomatic complexity: 119 Second operand 4 states. [2018-11-28 11:33:08,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:08,563 INFO L93 Difference]: Finished difference Result 383 states and 502 transitions. [2018-11-28 11:33:08,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:33:08,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 383 states and 502 transitions. [2018-11-28 11:33:08,569 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 162 [2018-11-28 11:33:08,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 383 states to 383 states and 502 transitions. [2018-11-28 11:33:08,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2018-11-28 11:33:08,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2018-11-28 11:33:08,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 383 states and 502 transitions. [2018-11-28 11:33:08,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:08,578 INFO L705 BuchiCegarLoop]: Abstraction has 383 states and 502 transitions. [2018-11-28 11:33:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 502 transitions. [2018-11-28 11:33:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 364. [2018-11-28 11:33:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-28 11:33:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 475 transitions. [2018-11-28 11:33:08,594 INFO L728 BuchiCegarLoop]: Abstraction has 364 states and 475 transitions. [2018-11-28 11:33:08,595 INFO L608 BuchiCegarLoop]: Abstraction has 364 states and 475 transitions. [2018-11-28 11:33:08,595 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 11:33:08,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 475 transitions. [2018-11-28 11:33:08,597 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 162 [2018-11-28 11:33:08,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:08,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:08,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:08,598 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:33:08,598 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; 4180#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-11-28 11:33:08,598 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-11-28 11:33:08,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1495319133, now seen corresponding path program 3 times [2018-11-28 11:33:08,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:08,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:08,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:08,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:08,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:33:08,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:33:08,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/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-11-28 11:33:08,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:33:08,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 11:33:08,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:33:08,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:33:08,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:33:08,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2018-11-28 11:33:08,916 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:33:08,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 4 times [2018-11-28 11:33:08,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:08,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:08,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:08,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:09,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 11:33:09,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-11-28 11:33:09,047 INFO L87 Difference]: Start difference. First operand 364 states and 475 transitions. cyclomatic complexity: 137 Second operand 18 states. [2018-11-28 11:33:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:09,471 INFO L93 Difference]: Finished difference Result 385 states and 499 transitions. [2018-11-28 11:33:09,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 11:33:09,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 385 states and 499 transitions. [2018-11-28 11:33:09,475 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 202 [2018-11-28 11:33:09,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 385 states to 377 states and 491 transitions. [2018-11-28 11:33:09,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 333 [2018-11-28 11:33:09,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 339 [2018-11-28 11:33:09,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 491 transitions. [2018-11-28 11:33:09,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:09,480 INFO L705 BuchiCegarLoop]: Abstraction has 377 states and 491 transitions. [2018-11-28 11:33:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 491 transitions. [2018-11-28 11:33:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 245. [2018-11-28 11:33:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-28 11:33:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 312 transitions. [2018-11-28 11:33:09,490 INFO L728 BuchiCegarLoop]: Abstraction has 245 states and 312 transitions. [2018-11-28 11:33:09,490 INFO L608 BuchiCegarLoop]: Abstraction has 245 states and 312 transitions. [2018-11-28 11:33:09,490 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 11:33:09,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 312 transitions. [2018-11-28 11:33:09,492 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 114 [2018-11-28 11:33:09,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:09,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:09,492 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-11-28 11:33:09,493 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:09,493 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-11-28 11:33:09,493 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:09,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash -782972685, now seen corresponding path program 1 times [2018-11-28 11:33:09,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:09,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:09,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:09,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:09,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash -695534387, now seen corresponding path program 1 times [2018-11-28 11:33:09,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:09,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:09,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:09,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:09,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1287081025, now seen corresponding path program 1 times [2018-11-28 11:33:09,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:09,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:09,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 11:33:09,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:33:09,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/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-11-28 11:33:09,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:09,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:33:09,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:33:09,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-11-28 11:33:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 11:33:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:33:09,935 INFO L87 Difference]: Start difference. First operand 245 states and 312 transitions. cyclomatic complexity: 82 Second operand 19 states. [2018-11-28 11:33:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:10,500 INFO L93 Difference]: Finished difference Result 312 states and 390 transitions. [2018-11-28 11:33:10,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 11:33:10,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 390 transitions. [2018-11-28 11:33:10,503 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 112 [2018-11-28 11:33:10,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 312 states and 390 transitions. [2018-11-28 11:33:10,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2018-11-28 11:33:10,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2018-11-28 11:33:10,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 390 transitions. [2018-11-28 11:33:10,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:10,506 INFO L705 BuchiCegarLoop]: Abstraction has 312 states and 390 transitions. [2018-11-28 11:33:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 390 transitions. [2018-11-28 11:33:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 231. [2018-11-28 11:33:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-28 11:33:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2018-11-28 11:33:10,513 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-11-28 11:33:10,513 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-11-28 11:33:10,513 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 11:33:10,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 286 transitions. [2018-11-28 11:33:10,514 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 80 [2018-11-28 11:33:10,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:10,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:10,515 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-11-28 11:33:10,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:33:10,515 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-11-28 11:33:10,515 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:10,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash -817472459, now seen corresponding path program 1 times [2018-11-28 11:33:10,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:10,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:10,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:10,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:10,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:10,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 2 times [2018-11-28 11:33:10,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:10,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:10,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:10,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:10,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:10,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:10,538 INFO L82 PathProgramCache]: Analyzing trace with hash -810276966, now seen corresponding path program 1 times [2018-11-28 11:33:10,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:10,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:10,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:10,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:10,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:11,057 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 156 [2018-11-28 11:33:11,262 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-11-28 11:33:11,369 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-28 11:33:12,011 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 143 [2018-11-28 11:33:12,197 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-28 11:33:12,199 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:33:12,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:33:12,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:33:12,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:33:12,199 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:33:12,199 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:33:12,199 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:33:12,199 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:33:12,199 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration13_Lasso [2018-11-28 11:33:12,199 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:33:12,199 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:33:12,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,594 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 134 [2018-11-28 11:33:12,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:12,968 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2018-11-28 11:33:13,280 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:33:13,281 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:33:13,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,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-11-28 11:33:13,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,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-11-28 11:33:13,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,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-11-28 11:33:13,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,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-11-28 11:33:13,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,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-11-28 11:33:13,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:13,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:13,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:13,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:13,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:13,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:13,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:13,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:13,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:13,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:13,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:13,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:13,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:13,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,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-11-28 11:33:13,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:13,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:13,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:13,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:13,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:13,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:13,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:13,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:13,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:13,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:13,379 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:33:13,405 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 11:33:13,406 INFO L444 ModelExtractionUtils]: 68 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 11:33:13,406 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:33:13,407 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:33:13,407 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:33:13,407 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-11-28 11:33:13,550 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 11:33:13,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:33:13,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:13,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:13,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:33:13,736 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-11-28 11:33:13,736 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 231 states and 286 transitions. cyclomatic complexity: 75 Second operand 9 states. [2018-11-28 11:33:13,952 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-11-28 11:33:13,952 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-11-28 11:33:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 11:33:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-11-28 11:33:13,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 11:33:13,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:13,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-28 11:33:13,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:13,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-28 11:33:13,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:13,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 346 transitions. [2018-11-28 11:33:13,957 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 80 [2018-11-28 11:33:13,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 280 states and 342 transitions. [2018-11-28 11:33:13,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2018-11-28 11:33:13,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2018-11-28 11:33:13,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 280 states and 342 transitions. [2018-11-28 11:33:13,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:13,960 INFO L705 BuchiCegarLoop]: Abstraction has 280 states and 342 transitions. [2018-11-28 11:33:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states and 342 transitions. [2018-11-28 11:33:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 247. [2018-11-28 11:33:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-28 11:33:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 308 transitions. [2018-11-28 11:33:13,967 INFO L728 BuchiCegarLoop]: Abstraction has 247 states and 308 transitions. [2018-11-28 11:33:13,967 INFO L608 BuchiCegarLoop]: Abstraction has 247 states and 308 transitions. [2018-11-28 11:33:13,967 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 11:33:13,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 247 states and 308 transitions. [2018-11-28 11:33:13,969 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 80 [2018-11-28 11:33:13,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:13,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:13,969 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-11-28 11:33:13,970 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:33:13,970 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:13,970 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-11-28 11:33:13,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:13,970 INFO L82 PathProgramCache]: Analyzing trace with hash -810277004, now seen corresponding path program 1 times [2018-11-28 11:33:13,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:13,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:13,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:33:14,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:33:14,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/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-11-28 11:33:14,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:14,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:33:14,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:33:14,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 11:33:14,071 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:33:14,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:14,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2018-11-28 11:33:14,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:14,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:33:14,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:33:14,123 INFO L87 Difference]: Start difference. First operand 247 states and 308 transitions. cyclomatic complexity: 83 Second operand 7 states. [2018-11-28 11:33:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:14,179 INFO L93 Difference]: Finished difference Result 412 states and 492 transitions. [2018-11-28 11:33:14,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:33:14,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 492 transitions. [2018-11-28 11:33:14,184 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 80 [2018-11-28 11:33:14,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 402 states and 480 transitions. [2018-11-28 11:33:14,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2018-11-28 11:33:14,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2018-11-28 11:33:14,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 480 transitions. [2018-11-28 11:33:14,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:14,186 INFO L705 BuchiCegarLoop]: Abstraction has 402 states and 480 transitions. [2018-11-28 11:33:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 480 transitions. [2018-11-28 11:33:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2018-11-28 11:33:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-28 11:33:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 353 transitions. [2018-11-28 11:33:14,195 INFO L728 BuchiCegarLoop]: Abstraction has 292 states and 353 transitions. [2018-11-28 11:33:14,195 INFO L608 BuchiCegarLoop]: Abstraction has 292 states and 353 transitions. [2018-11-28 11:33:14,195 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 11:33:14,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 353 transitions. [2018-11-28 11:33:14,197 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 80 [2018-11-28 11:33:14,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:14,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:14,198 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-11-28 11:33:14,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:33:14,198 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:14,198 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:14,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:14,198 INFO L82 PathProgramCache]: Analyzing trace with hash -607022711, now seen corresponding path program 1 times [2018-11-28 11:33:14,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:14,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:14,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:14,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 3 times [2018-11-28 11:33:14,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:14,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:14,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:14,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:14,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1908632850, now seen corresponding path program 1 times [2018-11-28 11:33:14,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:14,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:14,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:14,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 11:33:14,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:33:14,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/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-11-28 11:33:14,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:14,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:33:14,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:33:14,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-28 11:33:14,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:33:14,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:33:14,537 INFO L87 Difference]: Start difference. First operand 292 states and 353 transitions. cyclomatic complexity: 83 Second operand 20 states. [2018-11-28 11:33:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:14,893 INFO L93 Difference]: Finished difference Result 348 states and 405 transitions. [2018-11-28 11:33:14,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 11:33:14,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 348 states and 405 transitions. [2018-11-28 11:33:14,898 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 38 [2018-11-28 11:33:14,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 348 states to 330 states and 387 transitions. [2018-11-28 11:33:14,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 293 [2018-11-28 11:33:14,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2018-11-28 11:33:14,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 387 transitions. [2018-11-28 11:33:14,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:14,901 INFO L705 BuchiCegarLoop]: Abstraction has 330 states and 387 transitions. [2018-11-28 11:33:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 387 transitions. [2018-11-28 11:33:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 288. [2018-11-28 11:33:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-28 11:33:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 341 transitions. [2018-11-28 11:33:14,912 INFO L728 BuchiCegarLoop]: Abstraction has 288 states and 341 transitions. [2018-11-28 11:33:14,912 INFO L608 BuchiCegarLoop]: Abstraction has 288 states and 341 transitions. [2018-11-28 11:33:14,912 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 11:33:14,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 341 transitions. [2018-11-28 11:33:14,913 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 36 [2018-11-28 11:33:14,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:14,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:14,914 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-11-28 11:33:14,914 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:33:14,914 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:14,915 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-11-28 11:33:14,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:14,915 INFO L82 PathProgramCache]: Analyzing trace with hash 64206937, now seen corresponding path program 1 times [2018-11-28 11:33:14,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:14,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:14,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:14,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:14,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2018-11-28 11:33:14,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:14,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:14,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:14,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1573325915, now seen corresponding path program 1 times [2018-11-28 11:33:14,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:14,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:14,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:14,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:15,794 WARN L180 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 196 [2018-11-28 11:33:16,125 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2018-11-28 11:33:16,235 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-11-28 11:33:16,476 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-11-28 11:33:16,791 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2018-11-28 11:33:16,903 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-28 11:33:16,904 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:33:16,904 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:33:16,904 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:33:16,905 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:33:16,905 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:33:16,905 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:33:16,905 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:33:16,905 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:33:16,905 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration16_Lasso [2018-11-28 11:33:16,905 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:33:16,905 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:33:16,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:16,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:17,260 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 123 [2018-11-28 11:33:17,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:17,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:17,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:17,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:17,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:17,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:17,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:17,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:17,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:17,696 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:33:17,696 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:33:17,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:33:17,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:33:17,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:33:17,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,724 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:33:17,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,724 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:33:17,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,750 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:33:17,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,750 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:33:17,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:33:17,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:33:17,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:33:17,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:33:17,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:33:17,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:33:17,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:33:17,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:33:17,770 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:33:17,788 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:33:17,788 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 11:33:17,788 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:33:17,788 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:33:17,789 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:33:17,789 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-11-28 11:33:17,910 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-11-28 11:33:17,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:17,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:18,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:33:18,055 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-11-28 11:33:18,056 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 288 states and 341 transitions. cyclomatic complexity: 63 Second operand 4 states. [2018-11-28 11:33:18,082 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-11-28 11:33:18,082 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-11-28 11:33:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:33:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-28 11:33:18,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 2 letters. [2018-11-28 11:33:18,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:18,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 38 letters. Loop has 2 letters. [2018-11-28 11:33:18,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:18,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 4 letters. [2018-11-28 11:33:18,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:33:18,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 360 transitions. [2018-11-28 11:33:18,086 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2018-11-28 11:33:18,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 248 states and 297 transitions. [2018-11-28 11:33:18,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2018-11-28 11:33:18,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2018-11-28 11:33:18,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 297 transitions. [2018-11-28 11:33:18,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:18,088 INFO L705 BuchiCegarLoop]: Abstraction has 248 states and 297 transitions. [2018-11-28 11:33:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 297 transitions. [2018-11-28 11:33:18,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-11-28 11:33:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-28 11:33:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 297 transitions. [2018-11-28 11:33:18,093 INFO L728 BuchiCegarLoop]: Abstraction has 248 states and 297 transitions. [2018-11-28 11:33:18,093 INFO L608 BuchiCegarLoop]: Abstraction has 248 states and 297 transitions. [2018-11-28 11:33:18,093 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 11:33:18,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 297 transitions. [2018-11-28 11:33:18,094 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2018-11-28 11:33:18,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:18,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:18,095 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-11-28 11:33:18,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:18,096 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:18,096 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:18,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:18,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1719261906, now seen corresponding path program 1 times [2018-11-28 11:33:18,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:18,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:18,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:18,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:18,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-28 11:33:18,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:33:18,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/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-11-28 11:33:18,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:18,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 11:33:18,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:33:18,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-11-28 11:33:18,301 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:33:18,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2018-11-28 11:33:18,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:18,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:18,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:18,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:33:18,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:33:18,414 INFO L87 Difference]: Start difference. First operand 248 states and 297 transitions. cyclomatic complexity: 58 Second operand 20 states. [2018-11-28 11:33:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:18,979 INFO L93 Difference]: Finished difference Result 407 states and 488 transitions. [2018-11-28 11:33:18,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 11:33:18,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 407 states and 488 transitions. [2018-11-28 11:33:18,982 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 98 [2018-11-28 11:33:18,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 407 states to 401 states and 482 transitions. [2018-11-28 11:33:18,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 382 [2018-11-28 11:33:18,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 382 [2018-11-28 11:33:18,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 482 transitions. [2018-11-28 11:33:18,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:18,984 INFO L705 BuchiCegarLoop]: Abstraction has 401 states and 482 transitions. [2018-11-28 11:33:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 482 transitions. [2018-11-28 11:33:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 315. [2018-11-28 11:33:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-11-28 11:33:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 377 transitions. [2018-11-28 11:33:18,991 INFO L728 BuchiCegarLoop]: Abstraction has 315 states and 377 transitions. [2018-11-28 11:33:18,991 INFO L608 BuchiCegarLoop]: Abstraction has 315 states and 377 transitions. [2018-11-28 11:33:18,991 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 11:33:18,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 377 transitions. [2018-11-28 11:33:18,992 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 52 [2018-11-28 11:33:18,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:18,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:18,993 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-11-28 11:33:18,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:18,994 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:18,994 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:18,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2004988308, now seen corresponding path program 1 times [2018-11-28 11:33:18,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:18,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:18,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-28 11:33:19,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:33:19,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2962b64-df87-4a3d-8fa3-82573c67efe7/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-11-28 11:33:19,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:19,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:33:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 11:33:19,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:33:19,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-11-28 11:33:19,243 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:33:19,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:19,243 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2018-11-28 11:33:19,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:19,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:19,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:19,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:19,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:19,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 11:33:19,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:33:19,343 INFO L87 Difference]: Start difference. First operand 315 states and 377 transitions. cyclomatic complexity: 73 Second operand 21 states. [2018-11-28 11:33:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:20,018 INFO L93 Difference]: Finished difference Result 556 states and 672 transitions. [2018-11-28 11:33:20,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 11:33:20,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 556 states and 672 transitions. [2018-11-28 11:33:20,020 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 168 [2018-11-28 11:33:20,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 556 states to 556 states and 672 transitions. [2018-11-28 11:33:20,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 533 [2018-11-28 11:33:20,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 533 [2018-11-28 11:33:20,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 556 states and 672 transitions. [2018-11-28 11:33:20,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:33:20,025 INFO L705 BuchiCegarLoop]: Abstraction has 556 states and 672 transitions. [2018-11-28 11:33:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states and 672 transitions. [2018-11-28 11:33:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 325. [2018-11-28 11:33:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-28 11:33:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 387 transitions. [2018-11-28 11:33:20,032 INFO L728 BuchiCegarLoop]: Abstraction has 325 states and 387 transitions. [2018-11-28 11:33:20,032 INFO L608 BuchiCegarLoop]: Abstraction has 325 states and 387 transitions. [2018-11-28 11:33:20,032 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 11:33:20,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 325 states and 387 transitions. [2018-11-28 11:33:20,034 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 52 [2018-11-28 11:33:20,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:33:20,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:33:20,035 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-11-28 11:33:20,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:20,035 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:20,035 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~mem6;havoc merge_#t~post9;havoc merge_#t~mem8;havoc merge_#t~ite14;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem4;havoc merge_#t~ite13;havoc merge_#t~post5;havoc merge_#t~mem12;havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem7; 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-11-28 11:33:20,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:20,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1710153686, now seen corresponding path program 2 times [2018-11-28 11:33:20,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:20,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:20,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:20,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:20,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:20,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 4 times [2018-11-28 11:33:20,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:20,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:20,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:20,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:20,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:20,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:20,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1618831734, now seen corresponding path program 3 times [2018-11-28 11:33:20,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:20,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:20,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:20,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:20,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:20,235 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-28 11:33:21,517 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 265 DAG size of output: 222 [2018-11-28 11:33:21,916 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2018-11-28 11:33:22,093 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-28 11:33:22,230 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-11-28 11:33:23,863 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 267 DAG size of output: 234 [2018-11-28 11:33:24,156 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-28 11:33:24,305 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2018-11-28 11:33:24,766 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-11-28 11:33:25,201 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-11-28 11:33:26,472 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 192 DAG size of output: 186 [2018-11-28 11:33:27,145 WARN L180 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2018-11-28 11:33:27,147 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:33:27,147 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:33:27,147 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:33:27,147 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:33:27,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:33:27,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:33:27,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:33:27,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:33:27,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration19_Lasso [2018-11-28 11:33:27,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:33:27,148 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:33:27,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:27,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:27,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:27,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:27,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:33:27,546 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-11-28 11:33:27,548 INFO L168 Benchmark]: Toolchain (without parser) took 31021.82 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 817.4 MB). Free memory was 958.7 MB in the beginning and 1.5 GB in the end (delta: -521.4 MB). Peak memory consumption was 966.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:33:27,549 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:33:27,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.06 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:33:27,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:33:27,550 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 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: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:33:27,550 INFO L168 Benchmark]: RCFGBuilder took 268.06 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:33:27,551 INFO L168 Benchmark]: BuchiAutomizer took 30469.57 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 674.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -363.9 MB). Peak memory consumption was 981.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:33:27,553 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.06 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.97 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: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 268.06 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30469.57 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 674.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -363.9 MB). Peak memory consumption was 981.3 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...