./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/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_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/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_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/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-5842f4b [2018-11-18 17:05:41,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:05:41,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:05:41,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:05:41,840 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:05:41,841 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:05:41,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:05:41,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:05:41,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:05:41,844 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:05:41,845 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:05:41,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:05:41,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:05:41,849 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:05:41,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:05:41,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:05:41,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:05:41,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:05:41,853 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:05:41,855 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:05:41,856 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:05:41,857 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:05:41,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:05:41,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:05:41,859 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:05:41,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:05:41,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:05:41,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:05:41,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:05:41,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:05:41,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:05:41,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:05:41,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:05:41,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:05:41,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:05:41,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:05:41,865 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 17:05:41,876 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:05:41,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:05:41,877 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:05:41,877 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:05:41,878 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 17:05:41,878 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 17:05:41,878 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 17:05:41,878 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 17:05:41,878 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 17:05:41,878 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 17:05:41,879 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 17:05:41,879 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:05:41,879 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 17:05:41,879 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:05:41,879 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:05:41,879 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 17:05:41,879 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 17:05:41,879 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 17:05:41,880 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:05:41,880 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 17:05:41,880 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:05:41,880 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 17:05:41,880 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:05:41,880 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:05:41,880 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 17:05:41,880 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:05:41,881 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 17:05:41,881 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 17:05:41,881 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 17:05:41,884 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_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/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-18 17:05:41,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:05:41,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:05:41,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:05:41,919 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:05:41,919 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:05:41,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-11-18 17:05:41,968 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/data/7bf514cf3/3cf49089dc134a8ca536dac5b5aeffb6/FLAGfe1c6184e [2018-11-18 17:05:42,337 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:05:42,338 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/sv-benchmarks/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-11-18 17:05:42,344 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/data/7bf514cf3/3cf49089dc134a8ca536dac5b5aeffb6/FLAGfe1c6184e [2018-11-18 17:05:42,724 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/data/7bf514cf3/3cf49089dc134a8ca536dac5b5aeffb6 [2018-11-18 17:05:42,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:05:42,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:05:42,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:05:42,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:05:42,730 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:05:42,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:42,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d276455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42, skipping insertion in model container [2018-11-18 17:05:42,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:42,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:05:42,751 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:05:42,874 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:05:42,882 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:05:42,898 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:05:42,910 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:05:42,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42 WrapperNode [2018-11-18 17:05:42,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:05:42,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:05:42,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:05:42,912 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:05:42,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:42,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:42,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:05:42,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:05:42,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:05:42,949 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:05:42,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:42,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:42,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:42,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:42,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:42,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:42,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (1/1) ... [2018-11-18 17:05:43,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:05:43,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:05:43,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:05:43,019 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:05:43,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:05:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 17:05:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2018-11-18 17:05:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2018-11-18 17:05:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:05:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:05:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:05:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 17:05:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 17:05:43,351 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:05:43,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:05:43 BoogieIcfgContainer [2018-11-18 17:05:43,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:05:43,352 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 17:05:43,352 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 17:05:43,356 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 17:05:43,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 17:05:43,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 05:05:42" (1/3) ... [2018-11-18 17:05:43,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f86e665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 05:05:43, skipping insertion in model container [2018-11-18 17:05:43,359 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 17:05:43,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:05:42" (2/3) ... [2018-11-18 17:05:43,359 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f86e665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 05:05:43, skipping insertion in model container [2018-11-18 17:05:43,359 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 17:05:43,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:05:43" (3/3) ... [2018-11-18 17:05:43,361 INFO L375 chiAutomizerObserver]: Analyzing ICFG mergeSort_true-termination.c.i [2018-11-18 17:05:43,409 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:05:43,410 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 17:05:43,410 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 17:05:43,410 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 17:05:43,410 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:05:43,410 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:05:43,410 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 17:05:43,411 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:05:43,411 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 17:05:43,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-18 17:05:43,448 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2018-11-18 17:05:43,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:43,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:43,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 17:05:43,455 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 17:05:43,455 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 17:05:43,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-18 17:05:43,457 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2018-11-18 17:05:43,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:43,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:43,458 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 17:05:43,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 17:05:43,465 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 34#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; 21#L40-4true [2018-11-18 17:05:43,465 INFO L796 eck$LassoCheckResult]: Loop: 21#L40-4true assume true; 8#L40-1true 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; 4#L40-3true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 21#L40-4true [2018-11-18 17:05:43,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:43,471 INFO L82 PathProgramCache]: Analyzing trace with hash 91426, now seen corresponding path program 1 times [2018-11-18 17:05:43,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:43,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:43,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:43,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:43,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:43,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash 102442, now seen corresponding path program 1 times [2018-11-18 17:05:43,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:43,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:43,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:43,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:43,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:43,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:43,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1571222679, now seen corresponding path program 1 times [2018-11-18 17:05:43,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:43,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:43,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:43,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:43,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:43,879 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:05:43,880 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:05:43,880 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:05:43,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:05:43,881 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:05:43,881 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:05:43,881 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:05:43,881 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:05:43,881 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration1_Lasso [2018-11-18 17:05:43,881 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:05:43,882 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:05:43,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-18 17:05:43,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-18 17:05:43,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-18 17:05:43,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-18 17:05:43,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-18 17:05:44,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-18 17:05:44,369 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:05:44,375 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:05:44,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-18 17:05:44,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:44,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:44,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:44,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:44,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:44,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:44,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:44,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:44,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:44,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:44,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:44,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:44,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:44,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:44,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:44,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:44,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:44,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:44,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:44,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:44,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:44,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:44,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:44,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:44,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:44,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:44,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:44,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:44,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:44,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:44,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:44,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:44,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:44,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:44,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:44,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:44,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:44,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:44,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:44,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:44,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:44,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:44,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:44,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:44,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:44,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:44,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:44,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:44,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:44,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:44,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:44,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:44,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:44,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:44,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:44,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:44,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:44,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:44,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:44,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:44,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:44,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:44,425 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 17:05:44,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:44,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:44,428 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 17:05:44,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:44,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:44,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:44,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:44,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:44,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:44,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:44,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:44,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:44,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:44,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:44,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:44,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:44,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:44,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:44,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:44,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:44,499 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 17:05:44,519 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 17:05:44,519 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 17:05:44,521 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 17:05:44,522 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 17:05:44,522 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 17:05:44,523 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~a~0.base)_1, ULTIMATE.start_main_~a~0.offset) = -4*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~a~0.base)_1 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2018-11-18 17:05:44,554 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 17:05:44,560 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 17:05:44,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:44,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:44,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:05:44,653 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 17:05:44,653 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 4 states. [2018-11-18 17:05:44,692 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 4 states. Result 67 states and 89 transitions. Complement of second has 9 states. [2018-11-18 17:05:44,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 17:05:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 17:05:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-18 17:05:44,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-18 17:05:44,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:44,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 17:05:44,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:44,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-18 17:05:44,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:44,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2018-11-18 17:05:44,704 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 17:05:44,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 31 states and 42 transitions. [2018-11-18 17:05:44,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-18 17:05:44,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 17:05:44,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2018-11-18 17:05:44,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:44,712 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-11-18 17:05:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2018-11-18 17:05:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 17:05:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 17:05:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2018-11-18 17:05:44,736 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-11-18 17:05:44,736 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-11-18 17:05:44,736 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 17:05:44,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2018-11-18 17:05:44,737 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 17:05:44,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:44,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:44,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 17:05:44,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 17:05:44,739 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~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; 181#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; 186#L40-4 assume true; 173#L40-1 assume !(main_~i~1 < main_~n~0); 162#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 185#merge_sortENTRY [2018-11-18 17:05:44,739 INFO L796 eck$LassoCheckResult]: Loop: 185#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 166#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 160#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 185#merge_sortENTRY [2018-11-18 17:05:44,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1571222728, now seen corresponding path program 1 times [2018-11-18 17:05:44,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:44,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:44,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:05:44,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:05:44,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:05:44,782 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:05:44,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:44,782 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2018-11-18 17:05:44,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:44,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:44,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:44,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:44,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:44,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:05:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:05:45,000 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-18 17:05:45,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:45,015 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2018-11-18 17:05:45,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:05:45,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2018-11-18 17:05:45,017 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 17:05:45,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2018-11-18 17:05:45,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 17:05:45,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 17:05:45,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-18 17:05:45,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:45,020 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-18 17:05:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-18 17:05:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-18 17:05:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 17:05:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-18 17:05:45,023 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 17:05:45,023 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 17:05:45,023 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 17:05:45,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2018-11-18 17:05:45,024 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 17:05:45,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:45,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:45,024 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:45,025 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 17:05:45,025 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 252#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; 257#L40-4 assume true; 244#L40-1 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; 235#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 236#L40-4 assume true; 243#L40-1 assume !(main_~i~1 < main_~n~0); 233#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 256#merge_sortENTRY [2018-11-18 17:05:45,025 INFO L796 eck$LassoCheckResult]: Loop: 256#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 237#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 231#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 256#merge_sortENTRY [2018-11-18 17:05:45,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1741165679, now seen corresponding path program 1 times [2018-11-18 17:05:45,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:45,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:45,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:45,042 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 2 times [2018-11-18 17:05:45,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:45,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:45,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:45,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:45,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:45,051 INFO L82 PathProgramCache]: Analyzing trace with hash -746709084, now seen corresponding path program 1 times [2018-11-18 17:05:45,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:45,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:45,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:45,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:05:45,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:05:45,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:05:45,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:45,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:05:45,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:45,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 17:05:45,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:05:45,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:05:45,339 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-18 17:05:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:45,387 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-18 17:05:45,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:05:45,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 53 transitions. [2018-11-18 17:05:45,389 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 17:05:45,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 47 transitions. [2018-11-18 17:05:45,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 17:05:45,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 17:05:45,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 47 transitions. [2018-11-18 17:05:45,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:45,392 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-11-18 17:05:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 47 transitions. [2018-11-18 17:05:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-11-18 17:05:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 17:05:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-18 17:05:45,397 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 17:05:45,397 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 17:05:45,397 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 17:05:45,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-18 17:05:45,398 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 17:05:45,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:45,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:45,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 17:05:45,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 17:05:45,398 INFO L794 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 376#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 377#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; 382#L40-4 assume true; 383#L40-1 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; 388#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 384#L40-4 assume true; 369#L40-1 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; 360#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 361#L40-4 assume true; 368#L40-1 assume !(main_~i~1 < main_~n~0); 356#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 381#merge_sortENTRY [2018-11-18 17:05:45,399 INFO L796 eck$LassoCheckResult]: Loop: 381#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 362#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 358#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 381#merge_sortENTRY [2018-11-18 17:05:45,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash -745176936, now seen corresponding path program 2 times [2018-11-18 17:05:45,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:45,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:45,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:45,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:45,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 3 times [2018-11-18 17:05:45,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:45,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:45,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:45,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1119852861, now seen corresponding path program 2 times [2018-11-18 17:05:45,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:45,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:45,738 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-18 17:05:45,866 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:05:45,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:05:45,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:05:45,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:05:45,866 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:05:45,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:05:45,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:05:45,866 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:05:45,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration4_Lasso [2018-11-18 17:05:45,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:05:45,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:05:45,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,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-18 17:05:45,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,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-18 17:05:45,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-18 17:05:45,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:45,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:46,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-18 17:05:46,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-18 17:05:46,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-18 17:05:46,274 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:05:46,274 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:05:46,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:46,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:46,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:46,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:46,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,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-18 17:05:46,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:46,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:46,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:46,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,405 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 17:05:46,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,414 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 17:05:46,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:46,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:46,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:46,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:46,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:46,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:46,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:46,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:46,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:46,452 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 17:05:46,484 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 17:05:46,484 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 17:05:46,484 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 17:05:46,485 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 17:05:46,488 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 17:05:46,488 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2018-11-18 17:05:46,562 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 17:05:46,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:46,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:46,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:05:46,788 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-18 17:05:46,788 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 17:05:46,831 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 52 states and 64 transitions. Complement of second has 12 states. [2018-11-18 17:05:46,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 17:05:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 17:05:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-18 17:05:46,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 17:05:46,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:46,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-18 17:05:46,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:46,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 17:05:46,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:46,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 64 transitions. [2018-11-18 17:05:46,835 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 17:05:46,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 43 states and 55 transitions. [2018-11-18 17:05:46,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 17:05:46,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-18 17:05:46,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 55 transitions. [2018-11-18 17:05:46,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:46,837 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-11-18 17:05:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 55 transitions. [2018-11-18 17:05:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-18 17:05:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 17:05:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2018-11-18 17:05:46,851 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-18 17:05:46,851 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-18 17:05:46,851 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 17:05:46,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2018-11-18 17:05:46,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 17:05:46,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:46,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:46,853 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:46,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:46,856 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 546#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; 552#L40-4 assume true; 553#L40-1 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; 562#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 554#L40-4 assume true; 538#L40-1 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; 528#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 529#L40-4 assume true; 537#L40-1 assume !(main_~i~1 < main_~n~0); 526#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 551#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 532#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 525#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 558#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 530#L24 assume ~n < 2; 531#merge_sortFINAL assume true; 547#merge_sortEXIT >#90#return; 524#L27-1 [2018-11-18 17:05:46,857 INFO L796 eck$LassoCheckResult]: Loop: 524#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 559#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 561#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 523#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 559#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 561#L24 assume ~n < 2; 548#merge_sortFINAL assume true; 560#merge_sortEXIT >#90#return; 524#L27-1 [2018-11-18 17:05:46,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:46,857 INFO L82 PathProgramCache]: Analyzing trace with hash 984008125, now seen corresponding path program 1 times [2018-11-18 17:05:46,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:46,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:46,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:46,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:46,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:46,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1928789093, now seen corresponding path program 1 times [2018-11-18 17:05:46,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:46,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:46,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:46,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:46,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:46,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1297894743, now seen corresponding path program 1 times [2018-11-18 17:05:46,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:46,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:46,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:46,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:46,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 17:05:47,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:05:47,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:05:47,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:47,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:05:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:47,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-18 17:05:47,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 17:05:47,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:05:47,545 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. cyclomatic complexity: 15 Second operand 13 states. [2018-11-18 17:05:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:47,730 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2018-11-18 17:05:47,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 17:05:47,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 97 transitions. [2018-11-18 17:05:47,734 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 28 [2018-11-18 17:05:47,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 76 states and 92 transitions. [2018-11-18 17:05:47,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2018-11-18 17:05:47,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2018-11-18 17:05:47,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 92 transitions. [2018-11-18 17:05:47,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:47,736 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 92 transitions. [2018-11-18 17:05:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 92 transitions. [2018-11-18 17:05:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-18 17:05:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 17:05:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2018-11-18 17:05:47,741 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 90 transitions. [2018-11-18 17:05:47,742 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 90 transitions. [2018-11-18 17:05:47,742 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 17:05:47,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 90 transitions. [2018-11-18 17:05:47,743 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 28 [2018-11-18 17:05:47,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:47,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:47,744 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:47,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:47,744 INFO L794 eck$LassoCheckResult]: Stem: 788#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 776#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; 783#L40-4 assume true; 784#L40-1 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; 752#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 753#L40-4 assume true; 785#L40-1 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; 817#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 816#L40-4 assume true; 765#L40-1 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; 766#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 801#L40-4 assume true; 799#L40-1 assume !(main_~i~1 < main_~n~0); 758#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 795#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 757#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 759#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 790#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 791#L24 assume ~n < 2; 777#merge_sortFINAL assume true; 778#merge_sortEXIT >#90#return; 770#L27-1 [2018-11-18 17:05:47,744 INFO L796 eck$LassoCheckResult]: Loop: 770#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 792#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 818#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 769#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 792#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 818#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 769#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 792#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 818#L24 assume ~n < 2; 819#merge_sortFINAL assume true; 808#merge_sortEXIT >#90#return; 770#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 792#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 818#L24 assume ~n < 2; 819#merge_sortFINAL assume true; 808#merge_sortEXIT >#92#return; 805#L28 assume { :begin_inline_merge } true;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; 804#L11-4 assume true; 802#L11-1 assume !(merge_~k~0 < merge_~n); 800#L11-5 merge_~i~0 := 0; 798#L17-4 assume true; 796#L17-1 assume !(merge_~i~0 < merge_~n); 768#L17-5 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 771#L8 assume { :end_inline_merge } true; 779#merge_sortFINAL assume true; 822#merge_sortEXIT >#90#return; 770#L27-1 [2018-11-18 17:05:47,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:47,745 INFO L82 PathProgramCache]: Analyzing trace with hash -737214972, now seen corresponding path program 2 times [2018-11-18 17:05:47,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:47,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:47,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:47,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:47,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:47,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:47,761 INFO L82 PathProgramCache]: Analyzing trace with hash 788557670, now seen corresponding path program 1 times [2018-11-18 17:05:47,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:47,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:47,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:47,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:47,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:47,855 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-18 17:05:47,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:05:47,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/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-18 17:05:47,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:47,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:47,890 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-18 17:05:47,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:05:47,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-18 17:05:47,906 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:05:47,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:05:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:05:47,906 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-11-18 17:05:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:47,955 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-11-18 17:05:47,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:05:47,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 114 transitions. [2018-11-18 17:05:47,957 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 28 [2018-11-18 17:05:47,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 114 transitions. [2018-11-18 17:05:47,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-18 17:05:47,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2018-11-18 17:05:47,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 114 transitions. [2018-11-18 17:05:47,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:47,959 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2018-11-18 17:05:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 114 transitions. [2018-11-18 17:05:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2018-11-18 17:05:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 17:05:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2018-11-18 17:05:47,964 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 94 transitions. [2018-11-18 17:05:47,964 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 94 transitions. [2018-11-18 17:05:47,964 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 17:05:47,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 94 transitions. [2018-11-18 17:05:47,965 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 28 [2018-11-18 17:05:47,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:47,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:47,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:47,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:47,966 INFO L794 eck$LassoCheckResult]: Stem: 1040#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1026#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1027#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; 1035#L40-4 assume true; 1019#L40-1 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; 1008#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1009#L40-4 assume true; 1036#L40-1 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; 1062#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1061#L40-4 assume true; 1054#L40-1 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; 1059#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1053#L40-4 assume true; 1051#L40-1 assume !(main_~i~1 < main_~n~0); 1005#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1049#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1012#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1004#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1045#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1010#L24 assume ~n < 2; 1011#merge_sortFINAL assume true; 1028#merge_sortEXIT >#90#return; 1006#L27-1 [2018-11-18 17:05:47,966 INFO L796 eck$LassoCheckResult]: Loop: 1006#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1046#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1074#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1003#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1046#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1074#L24 assume ~n < 2; 1075#merge_sortFINAL assume true; 1067#merge_sortEXIT >#90#return; 1006#L27-1 [2018-11-18 17:05:47,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash -737214972, now seen corresponding path program 3 times [2018-11-18 17:05:47,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:47,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:47,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:47,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:47,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:47,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:47,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1928789093, now seen corresponding path program 2 times [2018-11-18 17:05:47,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:47,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:47,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:47,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:47,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:47,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:47,989 INFO L82 PathProgramCache]: Analyzing trace with hash 369577630, now seen corresponding path program 2 times [2018-11-18 17:05:47,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:47,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:47,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:47,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:47,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:48,134 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-18 17:05:48,607 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2018-11-18 17:05:48,820 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:05:48,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:05:48,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:05:48,820 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:05:48,820 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:05:48,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:05:48,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:05:48,820 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:05:48,821 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration7_Lasso [2018-11-18 17:05:48,821 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:05:48,821 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:05:48,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,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-18 17:05:48,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:48,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:49,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-18 17:05:49,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-18 17:05:49,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-18 17:05:49,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-18 17:05:49,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-18 17:05:49,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-18 17:05:49,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-18 17:05:49,243 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:05:49,243 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:05:49,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-18 17:05:49,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:49,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:49,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:49,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:49,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:49,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:49,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:49,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:49,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:49,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:49,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:49,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:49,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,346 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 17:05:49,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,347 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 17:05:49,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:49,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:49,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-18 17:05:49,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:49,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:49,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:49,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:49,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:49,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:49,397 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 17:05:49,443 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 17:05:49,443 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-18 17:05:49,444 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 17:05:49,444 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 17:05:49,445 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 17:05:49,445 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-18 17:05:49,445 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 17:05:49,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:49,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:49,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:05:49,610 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-18 17:05:49,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 94 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-11-18 17:05:49,804 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 94 transitions. cyclomatic complexity: 23. Second operand 7 states. Result 388 states and 503 transitions. Complement of second has 28 states. [2018-11-18 17:05:49,808 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-18 17:05:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 17:05:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-18 17:05:49,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 75 transitions. Stem has 22 letters. Loop has 8 letters. [2018-11-18 17:05:49,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:49,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 75 transitions. Stem has 30 letters. Loop has 8 letters. [2018-11-18 17:05:49,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:49,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 75 transitions. Stem has 22 letters. Loop has 16 letters. [2018-11-18 17:05:49,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:49,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 388 states and 503 transitions. [2018-11-18 17:05:49,820 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 104 [2018-11-18 17:05:49,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 388 states to 280 states and 370 transitions. [2018-11-18 17:05:49,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2018-11-18 17:05:49,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2018-11-18 17:05:49,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 280 states and 370 transitions. [2018-11-18 17:05:49,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:49,828 INFO L705 BuchiCegarLoop]: Abstraction has 280 states and 370 transitions. [2018-11-18 17:05:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states and 370 transitions. [2018-11-18 17:05:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 255. [2018-11-18 17:05:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 17:05:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 331 transitions. [2018-11-18 17:05:49,845 INFO L728 BuchiCegarLoop]: Abstraction has 255 states and 331 transitions. [2018-11-18 17:05:49,845 INFO L608 BuchiCegarLoop]: Abstraction has 255 states and 331 transitions. [2018-11-18 17:05:49,845 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 17:05:49,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 331 transitions. [2018-11-18 17:05:49,850 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 92 [2018-11-18 17:05:49,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:49,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:49,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:49,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 17:05:49,851 INFO L794 eck$LassoCheckResult]: Stem: 1686#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1654#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1655#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; 1672#L40-4 assume true; 1642#L40-1 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; 1623#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1624#L40-4 assume true; 1673#L40-1 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; 1713#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1704#L40-4 assume true; 1705#L40-1 assume !(main_~i~1 < main_~n~0); 1616#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1670#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1732#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1699#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1700#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1836#L24 assume ~n < 2; 1834#merge_sortFINAL assume true; 1833#merge_sortEXIT >#90#return; 1626#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1694#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1625#L24 assume ~n < 2; 1627#merge_sortFINAL assume true; 1683#merge_sortEXIT >#92#return; 1666#L28 assume { :begin_inline_merge } true;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; 1667#L11-4 assume true; 1650#L11-1 assume !!(merge_~k~0 < merge_~n); 1651#L12 [2018-11-18 17:05:49,851 INFO L796 eck$LassoCheckResult]: Loop: 1651#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; 1643#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 1680#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1689#L11-4 assume true; 1867#L11-1 assume !!(merge_~k~0 < merge_~n); 1651#L12 [2018-11-18 17:05:49,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1246149996, now seen corresponding path program 1 times [2018-11-18 17:05:49,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:49,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:49,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:49,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:49,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:49,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:49,879 INFO L82 PathProgramCache]: Analyzing trace with hash 47316153, now seen corresponding path program 1 times [2018-11-18 17:05:49,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:49,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:49,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:49,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1859119662, now seen corresponding path program 1 times [2018-11-18 17:05:49,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:49,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:49,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:49,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:49,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:05:49,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:05:49,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/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-18 17:05:49,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:49,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:05:50,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:50,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-18 17:05:50,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 17:05:50,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:05:50,123 INFO L87 Difference]: Start difference. First operand 255 states and 331 transitions. cyclomatic complexity: 100 Second operand 13 states. [2018-11-18 17:05:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:50,418 INFO L93 Difference]: Finished difference Result 984 states and 1349 transitions. [2018-11-18 17:05:50,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 17:05:50,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 984 states and 1349 transitions. [2018-11-18 17:05:50,429 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 394 [2018-11-18 17:05:50,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 984 states to 984 states and 1349 transitions. [2018-11-18 17:05:50,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 726 [2018-11-18 17:05:50,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 726 [2018-11-18 17:05:50,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 984 states and 1349 transitions. [2018-11-18 17:05:50,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:50,442 INFO L705 BuchiCegarLoop]: Abstraction has 984 states and 1349 transitions. [2018-11-18 17:05:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states and 1349 transitions. [2018-11-18 17:05:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 472. [2018-11-18 17:05:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-11-18 17:05:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 615 transitions. [2018-11-18 17:05:50,474 INFO L728 BuchiCegarLoop]: Abstraction has 472 states and 615 transitions. [2018-11-18 17:05:50,474 INFO L608 BuchiCegarLoop]: Abstraction has 472 states and 615 transitions. [2018-11-18 17:05:50,474 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 17:05:50,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 472 states and 615 transitions. [2018-11-18 17:05:50,477 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 206 [2018-11-18 17:05:50,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:50,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:50,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:50,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:50,478 INFO L794 eck$LassoCheckResult]: Stem: 3085#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3051#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 3052#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; 3065#L40-4 assume true; 3066#L40-1 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; 3111#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3067#L40-4 assume true; 3039#L40-1 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; 3040#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3108#L40-4 assume true; 3109#L40-1 assume !(main_~i~1 < main_~n~0); 3063#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 3127#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3128#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3102#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 3103#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3153#L24 assume ~n < 2; 3152#merge_sortFINAL assume true; 3149#merge_sortEXIT >#90#return; 3024#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 3279#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3023#L24 assume ~n < 2; 3025#merge_sortFINAL assume true; 3081#merge_sortEXIT >#92#return; 3082#L28 assume { :begin_inline_merge } true;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; 3383#L11-4 assume true; 3381#L11-1 assume !!(merge_~k~0 < merge_~n); 3379#L12 [2018-11-18 17:05:50,478 INFO L796 eck$LassoCheckResult]: Loop: 3379#L12 assume !(merge_~j~0 == merge_~n); 3378#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); 3376#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; 3375#L14-2 merge_#t~ite14 := merge_#t~ite13; 3373#L13-2 merge_#t~ite15 := merge_#t~ite14; 3371#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 3372#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 3367#L11-4 assume true; 3368#L11-1 assume !!(merge_~k~0 < merge_~n); 3379#L12 [2018-11-18 17:05:50,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1246149996, now seen corresponding path program 2 times [2018-11-18 17:05:50,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:50,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:50,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:50,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:50,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:50,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:50,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1291112546, now seen corresponding path program 1 times [2018-11-18 17:05:50,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:50,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:50,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:50,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:50,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:50,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:50,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2069562537, now seen corresponding path program 1 times [2018-11-18 17:05:50,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:50,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:50,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:50,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:50,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:50,652 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-11-18 17:05:50,944 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-11-18 17:05:51,345 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2018-11-18 17:05:51,406 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:05:51,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:05:51,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:05:51,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:05:51,407 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:05:51,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:05:51,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:05:51,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:05:51,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration9_Lasso [2018-11-18 17:05:51,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:05:51,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:05:51,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,600 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2018-11-18 17:05:51,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,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-18 17:05:51,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:51,863 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2018-11-18 17:05:52,138 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-18 17:05:52,210 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:05:52,210 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:05:52,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:52,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:52,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:52,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:52,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:52,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:52,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:52,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:52,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:52,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-18 17:05:52,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:52,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:52,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:52,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:52,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:52,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:52,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:52,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:52,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-18 17:05:52,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:52,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:52,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:52,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:52,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:52,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:52,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:52,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:52,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-18 17:05:52,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:52,216 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 17:05:52,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:52,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:52,217 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 17:05:52,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:52,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:52,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-18 17:05:52,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:52,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:52,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:52,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:52,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:52,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:52,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:52,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-18 17:05:52,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:52,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:52,223 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-18 17:05:52,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:52,255 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-18 17:05:52,255 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-18 17:05:53,595 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 17:05:54,425 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2018-11-18 17:05:54,425 INFO L444 ModelExtractionUtils]: 175 out of 208 variables were initially zero. Simplification set additionally 29 variables to zero. [2018-11-18 17:05:54,426 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 17:05:54,427 INFO L440 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2018-11-18 17:05:54,428 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 17:05:54,428 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_merge_~x~0.base)_1) = -1*merge_sort_merge_~x~0.offset - 4*merge_sort_merge_~k~0 + 1*v_rep(select #length merge_sort_merge_~x~0.base)_1 Supporting invariants [] [2018-11-18 17:05:54,477 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 17:05:54,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 17:05:54,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:54,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:54,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:05:54,548 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 17:05:54,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 472 states and 615 transitions. cyclomatic complexity: 176 Second operand 6 states. [2018-11-18 17:05:54,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 472 states and 615 transitions. cyclomatic complexity: 176. Second operand 6 states. Result 1007 states and 1325 transitions. Complement of second has 14 states. [2018-11-18 17:05:54,609 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-18 17:05:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 17:05:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-18 17:05:54,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 27 letters. Loop has 9 letters. [2018-11-18 17:05:54,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:54,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 36 letters. Loop has 9 letters. [2018-11-18 17:05:54,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:54,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 27 letters. Loop has 18 letters. [2018-11-18 17:05:54,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:54,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1007 states and 1325 transitions. [2018-11-18 17:05:54,619 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 163 [2018-11-18 17:05:54,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1007 states to 765 states and 997 transitions. [2018-11-18 17:05:54,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 347 [2018-11-18 17:05:54,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 389 [2018-11-18 17:05:54,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 765 states and 997 transitions. [2018-11-18 17:05:54,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:54,625 INFO L705 BuchiCegarLoop]: Abstraction has 765 states and 997 transitions. [2018-11-18 17:05:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states and 997 transitions. [2018-11-18 17:05:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 725. [2018-11-18 17:05:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-18 17:05:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 955 transitions. [2018-11-18 17:05:54,642 INFO L728 BuchiCegarLoop]: Abstraction has 725 states and 955 transitions. [2018-11-18 17:05:54,642 INFO L608 BuchiCegarLoop]: Abstraction has 725 states and 955 transitions. [2018-11-18 17:05:54,642 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 17:05:54,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 725 states and 955 transitions. [2018-11-18 17:05:54,646 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 160 [2018-11-18 17:05:54,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:54,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:54,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:54,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 17:05:54,648 INFO L794 eck$LassoCheckResult]: Stem: 4761#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4727#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 4728#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; 4741#L40-4 assume true; 4742#L40-1 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; 4790#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4743#L40-4 assume true; 4714#L40-1 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; 4715#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4787#L40-4 assume true; 4789#L40-1 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; 4687#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4688#L40-4 assume true; 4713#L40-1 assume !(main_~i~1 < main_~n~0); 4673#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 4811#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4810#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4802#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4806#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4808#L24 assume ~n < 2; 4807#merge_sortFINAL assume true; 4805#merge_sortEXIT >#90#return; 4703#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 4803#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4799#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4709#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4846#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4847#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4887#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4890#merge_sortENTRY [2018-11-18 17:05:54,648 INFO L796 eck$LassoCheckResult]: Loop: 4890#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4892#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4886#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4890#merge_sortENTRY [2018-11-18 17:05:54,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:54,648 INFO L82 PathProgramCache]: Analyzing trace with hash -126625417, now seen corresponding path program 3 times [2018-11-18 17:05:54,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:54,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:54,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:54,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:54,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 17:05:54,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:05:54,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/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-18 17:05:54,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 17:05:54,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 17:05:54,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:05:54,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:05:54,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:54,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2018-11-18 17:05:54,923 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:05:54,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:54,923 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 4 times [2018-11-18 17:05:54,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:54,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:54,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:54,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:54,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:55,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 17:05:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-11-18 17:05:55,053 INFO L87 Difference]: Start difference. First operand 725 states and 955 transitions. cyclomatic complexity: 282 Second operand 18 states. [2018-11-18 17:05:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:55,378 INFO L93 Difference]: Finished difference Result 431 states and 545 transitions. [2018-11-18 17:05:55,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 17:05:55,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 545 transitions. [2018-11-18 17:05:55,381 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 138 [2018-11-18 17:05:55,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 423 states and 537 transitions. [2018-11-18 17:05:55,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 298 [2018-11-18 17:05:55,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2018-11-18 17:05:55,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 423 states and 537 transitions. [2018-11-18 17:05:55,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:55,384 INFO L705 BuchiCegarLoop]: Abstraction has 423 states and 537 transitions. [2018-11-18 17:05:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states and 537 transitions. [2018-11-18 17:05:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 280. [2018-11-18 17:05:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-18 17:05:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 349 transitions. [2018-11-18 17:05:55,390 INFO L728 BuchiCegarLoop]: Abstraction has 280 states and 349 transitions. [2018-11-18 17:05:55,391 INFO L608 BuchiCegarLoop]: Abstraction has 280 states and 349 transitions. [2018-11-18 17:05:55,391 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 17:05:55,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 280 states and 349 transitions. [2018-11-18 17:05:55,392 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 69 [2018-11-18 17:05:55,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:55,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:55,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 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-18 17:05:55,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 17:05:55,394 INFO L794 eck$LassoCheckResult]: Stem: 6016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5992#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 5993#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; 6002#L40-4 assume true; 6003#L40-1 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; 5964#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5965#L40-4 assume true; 5982#L40-1 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; 5983#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6038#L40-4 assume true; 6039#L40-1 assume !(main_~i~1 < main_~n~0); 5963#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 6001#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6173#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6112#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6115#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6114#L24 assume ~n < 2; 6111#merge_sortFINAL assume true; 6113#merge_sortEXIT >#90#return; 6026#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6025#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6027#L24 assume ~n < 2; 6172#merge_sortFINAL assume true; 6130#merge_sortEXIT >#92#return; 6108#L28 assume { :begin_inline_merge } true;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; 6129#L11-4 assume true; 6128#L11-1 assume !!(merge_~k~0 < merge_~n); 6117#L12 assume !(merge_~j~0 == merge_~n); 6010#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; 5978#L13-2 merge_#t~ite15 := merge_#t~ite14; 5985#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 6022#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6023#L11-4 assume true; 6020#L11-1 assume !(merge_~k~0 < merge_~n); 6024#L11-5 merge_~i~0 := 0; 5961#L17-4 [2018-11-18 17:05:55,394 INFO L796 eck$LassoCheckResult]: Loop: 5961#L17-4 assume true; 5980#L17-1 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; 5959#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 5961#L17-4 [2018-11-18 17:05:55,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1878767314, now seen corresponding path program 1 times [2018-11-18 17:05:55,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:55,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:55,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:55,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 17:05:55,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:05:55,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:05:55,477 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:05:55,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:55,477 INFO L82 PathProgramCache]: Analyzing trace with hash 76624, now seen corresponding path program 1 times [2018-11-18 17:05:55,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:55,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:05:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:05:55,540 INFO L87 Difference]: Start difference. First operand 280 states and 349 transitions. cyclomatic complexity: 87 Second operand 4 states. [2018-11-18 17:05:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:55,562 INFO L93 Difference]: Finished difference Result 330 states and 409 transitions. [2018-11-18 17:05:55,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:05:55,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 330 states and 409 transitions. [2018-11-18 17:05:55,565 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 83 [2018-11-18 17:05:55,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 330 states to 330 states and 409 transitions. [2018-11-18 17:05:55,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2018-11-18 17:05:55,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2018-11-18 17:05:55,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 409 transitions. [2018-11-18 17:05:55,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:55,568 INFO L705 BuchiCegarLoop]: Abstraction has 330 states and 409 transitions. [2018-11-18 17:05:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 409 transitions. [2018-11-18 17:05:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 322. [2018-11-18 17:05:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-11-18 17:05:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 401 transitions. [2018-11-18 17:05:55,575 INFO L728 BuchiCegarLoop]: Abstraction has 322 states and 401 transitions. [2018-11-18 17:05:55,575 INFO L608 BuchiCegarLoop]: Abstraction has 322 states and 401 transitions. [2018-11-18 17:05:55,575 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 17:05:55,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 322 states and 401 transitions. [2018-11-18 17:05:55,576 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 83 [2018-11-18 17:05:55,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:55,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:55,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 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-18 17:05:55,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 17:05:55,577 INFO L794 eck$LassoCheckResult]: Stem: 6636#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6611#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 6612#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; 6620#L40-4 assume true; 6600#L40-1 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; 6581#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6582#L40-4 assume true; 6621#L40-1 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; 6663#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6661#L40-4 assume true; 6662#L40-1 assume !(main_~i~1 < main_~n~0); 6596#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 6618#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6728#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6725#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6726#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6729#L24 assume ~n < 2; 6727#merge_sortFINAL assume true; 6724#merge_sortEXIT >#90#return; 6708#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6709#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6722#L24 assume ~n < 2; 6723#merge_sortFINAL assume true; 6707#merge_sortEXIT >#92#return; 6706#L28 assume { :begin_inline_merge } true;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; 6705#L11-4 assume true; 6704#L11-1 assume !!(merge_~k~0 < merge_~n); 6703#L12 assume !(merge_~j~0 == merge_~n); 6698#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); 6697#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; 6685#L14-2 merge_#t~ite14 := merge_#t~ite13; 6720#L13-2 merge_#t~ite15 := merge_#t~ite14; 6721#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 6699#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6700#L11-4 assume true; 6670#L11-1 assume !(merge_~k~0 < merge_~n); 6669#L11-5 merge_~i~0 := 0; 6595#L17-4 [2018-11-18 17:05:55,578 INFO L796 eck$LassoCheckResult]: Loop: 6595#L17-4 assume true; 6598#L17-1 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; 6619#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 6595#L17-4 [2018-11-18 17:05:55,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1077417400, now seen corresponding path program 1 times [2018-11-18 17:05:55,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:55,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 17:05:55,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:05:55,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/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-18 17:05:55,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:55,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 17:05:55,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:55,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-18 17:05:55,708 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:05:55,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash 76624, now seen corresponding path program 2 times [2018-11-18 17:05:55,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:55,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:55,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:05:55,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:05:55,736 INFO L87 Difference]: Start difference. First operand 322 states and 401 transitions. cyclomatic complexity: 97 Second operand 7 states. [2018-11-18 17:05:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:55,776 INFO L93 Difference]: Finished difference Result 513 states and 625 transitions. [2018-11-18 17:05:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:05:55,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 625 transitions. [2018-11-18 17:05:55,781 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 83 [2018-11-18 17:05:55,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 510 states and 619 transitions. [2018-11-18 17:05:55,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 292 [2018-11-18 17:05:55,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 292 [2018-11-18 17:05:55,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 510 states and 619 transitions. [2018-11-18 17:05:55,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:55,785 INFO L705 BuchiCegarLoop]: Abstraction has 510 states and 619 transitions. [2018-11-18 17:05:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states and 619 transitions. [2018-11-18 17:05:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 394. [2018-11-18 17:05:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-18 17:05:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 480 transitions. [2018-11-18 17:05:55,793 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 480 transitions. [2018-11-18 17:05:55,793 INFO L608 BuchiCegarLoop]: Abstraction has 394 states and 480 transitions. [2018-11-18 17:05:55,793 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 17:05:55,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 394 states and 480 transitions. [2018-11-18 17:05:55,795 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 83 [2018-11-18 17:05:55,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:55,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:55,796 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 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-18 17:05:55,796 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 17:05:55,797 INFO L794 eck$LassoCheckResult]: Stem: 7597#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7573#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 7574#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; 7582#L40-4 assume true; 7563#L40-1 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; 7540#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7541#L40-4 assume true; 7583#L40-1 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; 7622#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7620#L40-4 assume true; 7621#L40-1 assume !(main_~i~1 < main_~n~0); 7560#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 7580#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7688#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 7685#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 7686#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7689#L24 assume ~n < 2; 7687#merge_sortFINAL assume true; 7684#merge_sortEXIT >#90#return; 7669#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 7670#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7681#L24 assume ~n < 2; 7682#merge_sortFINAL assume true; 7668#merge_sortEXIT >#92#return; 7667#L28 assume { :begin_inline_merge } true;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; 7666#L11-4 assume true; 7665#L11-1 assume !!(merge_~k~0 < merge_~n); 7664#L12 assume !(merge_~j~0 == merge_~n); 7663#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); 7661#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; 7660#L14-2 merge_#t~ite14 := merge_#t~ite13; 7659#L13-2 merge_#t~ite15 := merge_#t~ite14; 7658#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 7657#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7654#L11-4 assume true; 7655#L11-1 assume !!(merge_~k~0 < merge_~n); 7649#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; 7650#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 7787#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7653#L11-4 assume true; 7630#L11-1 assume !(merge_~k~0 < merge_~n); 7629#L11-5 merge_~i~0 := 0; 7559#L17-4 [2018-11-18 17:05:55,797 INFO L796 eck$LassoCheckResult]: Loop: 7559#L17-4 assume true; 7561#L17-1 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; 7581#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 7559#L17-4 [2018-11-18 17:05:55,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1971073064, now seen corresponding path program 1 times [2018-11-18 17:05:55,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:55,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:55,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:55,819 INFO L82 PathProgramCache]: Analyzing trace with hash 76624, now seen corresponding path program 3 times [2018-11-18 17:05:55,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:55,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:55,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:55,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:55,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash -555174455, now seen corresponding path program 1 times [2018-11-18 17:05:55,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:56,539 WARN L180 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 194 [2018-11-18 17:05:56,812 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2018-11-18 17:05:57,717 WARN L180 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 136 [2018-11-18 17:05:57,976 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-18 17:05:57,977 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:05:57,977 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:05:57,977 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:05:57,977 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:05:57,977 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:05:57,977 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:05:57,977 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:05:57,977 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:05:57,977 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration13_Lasso [2018-11-18 17:05:57,978 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:05:57,978 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:05:57,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:57,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-18 17:05:57,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:57,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-18 17:05:57,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-18 17:05:57,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:57,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-18 17:05:58,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,381 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2018-11-18 17:05:58,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:05:58,651 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2018-11-18 17:05:58,938 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:05:58,939 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:05:58,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:58,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:58,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:58,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:58,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:58,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:58,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:58,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:58,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:58,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:58,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:58,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:58,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:58,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:58,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:58,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:58,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:58,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:58,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:58,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:58,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:58,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:58,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:58,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:58,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:58,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:58,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:58,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:58,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:58,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:58,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:58,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:58,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:58,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:58,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:58,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:58,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:58,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:58,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:58,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:58,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:58,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:58,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:58,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:58,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:58,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:58,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:58,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:58,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:58,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:58,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:58,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:58,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:58,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:58,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:58,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:05:58,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:58,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:58,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:58,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:05:58,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:05:58,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:05:58,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:05:58,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:05:58,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:05:58,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:05:58,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:05:58,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:05:58,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:05:58,985 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 17:05:59,018 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 17:05:59,019 INFO L444 ModelExtractionUtils]: 61 out of 70 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 17:05:59,019 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 17:05:59,019 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 17:05:59,020 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 17:05:59,020 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, v_rep(select #length merge_sort_merge_~a.base)_2, merge_sort_merge_~i~0) = -1*merge_sort_merge_~a.offset + 1*v_rep(select #length merge_sort_merge_~a.base)_2 - 4*merge_sort_merge_~i~0 Supporting invariants [] [2018-11-18 17:05:59,081 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-11-18 17:05:59,083 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 17:05:59,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:59,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:59,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:05:59,157 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-18 17:05:59,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 394 states and 480 transitions. cyclomatic complexity: 104 Second operand 5 states. [2018-11-18 17:05:59,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 394 states and 480 transitions. cyclomatic complexity: 104. Second operand 5 states. Result 411 states and 500 transitions. Complement of second has 14 states. [2018-11-18 17:05:59,210 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-18 17:05:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 17:05:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-18 17:05:59,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 42 letters. Loop has 3 letters. [2018-11-18 17:05:59,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:59,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 45 letters. Loop has 3 letters. [2018-11-18 17:05:59,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:59,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 42 letters. Loop has 6 letters. [2018-11-18 17:05:59,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:05:59,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 500 transitions. [2018-11-18 17:05:59,214 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 74 [2018-11-18 17:05:59,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 328 states and 401 transitions. [2018-11-18 17:05:59,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2018-11-18 17:05:59,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 217 [2018-11-18 17:05:59,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 328 states and 401 transitions. [2018-11-18 17:05:59,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:05:59,217 INFO L705 BuchiCegarLoop]: Abstraction has 328 states and 401 transitions. [2018-11-18 17:05:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 401 transitions. [2018-11-18 17:05:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-18 17:05:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-18 17:05:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 401 transitions. [2018-11-18 17:05:59,224 INFO L728 BuchiCegarLoop]: Abstraction has 328 states and 401 transitions. [2018-11-18 17:05:59,224 INFO L608 BuchiCegarLoop]: Abstraction has 328 states and 401 transitions. [2018-11-18 17:05:59,224 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 17:05:59,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 401 transitions. [2018-11-18 17:05:59,225 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 74 [2018-11-18 17:05:59,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:05:59,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:05:59,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 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-18 17:05:59,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:59,227 INFO L794 eck$LassoCheckResult]: Stem: 8649#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8617#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 8618#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; 8629#L40-4 assume true; 8606#L40-1 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; 8586#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8587#L40-4 assume true; 8630#L40-1 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; 8674#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8673#L40-4 assume true; 8672#L40-1 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; 8670#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8667#L40-4 assume true; 8605#L40-1 assume !(main_~i~1 < main_~n~0); 8601#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 8626#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8752#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8745#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8750#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8659#L24 assume ~n < 2; 8749#merge_sortFINAL assume true; 8744#merge_sortEXIT >#90#return; 8621#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8753#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8751#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8743#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8746#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8748#L24 assume ~n < 2; 8747#merge_sortFINAL assume true; 8742#merge_sortEXIT >#90#return; 8738#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8739#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8758#L24 assume ~n < 2; 8740#merge_sortFINAL assume true; 8741#merge_sortEXIT >#92#return; 8757#L28 assume { :begin_inline_merge } true;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; 8733#L11-4 assume true; 8734#L11-1 assume !!(merge_~k~0 < merge_~n); 8729#L12 assume !(merge_~j~0 == merge_~n); 8730#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); 8634#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; 8635#L14-2 merge_#t~ite14 := merge_#t~ite13; 8802#L13-2 merge_#t~ite15 := merge_#t~ite14; 8796#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 8797#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8651#L11-4 assume true; 8652#L11-1 assume !!(merge_~k~0 < merge_~n); 8697#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; 8698#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 8792#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8793#L11-4 assume true; 8680#L11-1 assume !(merge_~k~0 < merge_~n); 8655#L11-5 merge_~i~0 := 0; 8656#L17-4 assume true; 8627#L17-1 assume !(merge_~i~0 < merge_~n); 8628#L17-5 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 8623#L8 assume { :end_inline_merge } true; 8619#merge_sortFINAL assume true; 8622#merge_sortEXIT >#92#return; 8624#L28 assume { :begin_inline_merge } true;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; 8625#L11-4 assume true; 8872#L11-1 assume !!(merge_~k~0 < merge_~n); 8637#L12 assume !(merge_~j~0 == merge_~n); 8638#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); 8885#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; 8864#L14-2 merge_#t~ite14 := merge_#t~ite13; 8865#L13-2 merge_#t~ite15 := merge_#t~ite14; 8894#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 8892#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8890#L11-4 assume true; 8888#L11-1 assume !!(merge_~k~0 < merge_~n); 8887#L12 [2018-11-18 17:05:59,227 INFO L796 eck$LassoCheckResult]: Loop: 8887#L12 assume !(merge_~j~0 == merge_~n); 8886#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); 8631#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; 8632#L14-2 merge_#t~ite14 := merge_#t~ite13; 8896#L13-2 merge_#t~ite15 := merge_#t~ite14; 8895#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 8893#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8891#L11-4 assume true; 8889#L11-1 assume !!(merge_~k~0 < merge_~n); 8887#L12 [2018-11-18 17:05:59,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:59,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1296090656, now seen corresponding path program 1 times [2018-11-18 17:05:59,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:59,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:59,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:59,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:59,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 17:05:59,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:05:59,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/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-18 17:05:59,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:59,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 36 proven. 26 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 17:05:59,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:59,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-11-18 17:05:59,516 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:05:59,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash -483894816, now seen corresponding path program 1 times [2018-11-18 17:05:59,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:05:59,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:05:59,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:59,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:05:59,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:05:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:05:59,638 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-18 17:05:59,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 17:05:59,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-18 17:05:59,678 INFO L87 Difference]: Start difference. First operand 328 states and 401 transitions. cyclomatic complexity: 88 Second operand 20 states. [2018-11-18 17:06:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:06:00,372 INFO L93 Difference]: Finished difference Result 532 states and 645 transitions. [2018-11-18 17:06:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 17:06:00,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 645 transitions. [2018-11-18 17:06:00,374 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 171 [2018-11-18 17:06:00,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 522 states and 635 transitions. [2018-11-18 17:06:00,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 385 [2018-11-18 17:06:00,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 385 [2018-11-18 17:06:00,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 635 transitions. [2018-11-18 17:06:00,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:06:00,377 INFO L705 BuchiCegarLoop]: Abstraction has 522 states and 635 transitions. [2018-11-18 17:06:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 635 transitions. [2018-11-18 17:06:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 407. [2018-11-18 17:06:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-11-18 17:06:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 494 transitions. [2018-11-18 17:06:00,386 INFO L728 BuchiCegarLoop]: Abstraction has 407 states and 494 transitions. [2018-11-18 17:06:00,386 INFO L608 BuchiCegarLoop]: Abstraction has 407 states and 494 transitions. [2018-11-18 17:06:00,386 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 17:06:00,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 494 transitions. [2018-11-18 17:06:00,388 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2018-11-18 17:06:00,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:06:00,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:06:00,389 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:06:00,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:06:00,390 INFO L794 eck$LassoCheckResult]: Stem: 9776#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9751#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 9752#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; 9759#L40-4 assume true; 9760#L40-1 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; 9721#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9722#L40-4 assume true; 9739#L40-1 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; 9740#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9800#L40-4 assume true; 9799#L40-1 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; 9797#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9793#L40-4 assume true; 9795#L40-1 assume !(main_~i~1 < main_~n~0); 9715#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 9757#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9801#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9789#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9790#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9787#L24 assume ~n < 2; 9852#merge_sortFINAL assume true; 9848#merge_sortEXIT >#90#return; 9730#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 9812#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9844#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9838#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9839#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9858#L24 assume ~n < 2; 9856#merge_sortFINAL assume true; 9837#merge_sortEXIT >#90#return; 9724#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 9791#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9723#L24 assume ~n < 2; 9725#merge_sortFINAL assume true; 9920#merge_sortEXIT >#92#return; 9919#L28 assume { :begin_inline_merge } true;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; 9918#L11-4 assume true; 9917#L11-1 assume !!(merge_~k~0 < merge_~n); 9915#L12 assume !(merge_~j~0 == merge_~n); 9916#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); 9763#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; 9764#L14-2 merge_#t~ite14 := merge_#t~ite13; 9936#L13-2 merge_#t~ite15 := merge_#t~ite14; 9932#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 9933#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 9779#L11-4 assume true; 9780#L11-1 assume !!(merge_~k~0 < merge_~n); 9886#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; 9887#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 9946#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 9945#L11-4 assume true; 9833#L11-1 assume !(merge_~k~0 < merge_~n); 9804#L11-5 merge_~i~0 := 0; 9805#L17-4 assume true; 9737#L17-1 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; 9758#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 9735#L17-4 assume true; 9736#L17-1 assume !(merge_~i~0 < merge_~n); 9745#L17-5 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 9746#L8 assume { :end_inline_merge } true; 9753#merge_sortFINAL assume true; 9754#merge_sortEXIT >#92#return; 9755#L28 assume { :begin_inline_merge } true;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; 9756#L11-4 assume true; 10085#L11-1 assume !!(merge_~k~0 < merge_~n); 10083#L12 assume !(merge_~j~0 == merge_~n); 10084#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); 10080#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; 10078#L14-2 merge_#t~ite14 := merge_#t~ite13; 10079#L13-2 merge_#t~ite15 := merge_#t~ite14; 10091#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 10090#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10089#L11-4 assume true; 10088#L11-1 assume !!(merge_~k~0 < merge_~n); 9766#L12 [2018-11-18 17:06:00,390 INFO L796 eck$LassoCheckResult]: Loop: 9766#L12 assume !(merge_~j~0 == merge_~n); 9727#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); 9728#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; 9761#L14-2 merge_#t~ite14 := merge_#t~ite13; 10097#L13-2 merge_#t~ite15 := merge_#t~ite14; 10096#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 10095#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10094#L11-4 assume true; 10087#L11-1 assume !!(merge_~k~0 < merge_~n); 9766#L12 [2018-11-18 17:06:00,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:06:00,390 INFO L82 PathProgramCache]: Analyzing trace with hash -615560093, now seen corresponding path program 1 times [2018-11-18 17:06:00,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:06:00,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:06:00,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:06:00,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:06:00,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:06:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:06:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 17:06:00,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:06:00,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb8d8bc7-1862-4f41-8778-a0d5b00bbdc9/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-18 17:06:00,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:06:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:06:00,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:06:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 17:06:00,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:06:00,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-11-18 17:06:00,692 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:06:00,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:06:00,693 INFO L82 PathProgramCache]: Analyzing trace with hash -483894816, now seen corresponding path program 2 times [2018-11-18 17:06:00,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:06:00,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:06:00,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:06:00,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:06:00,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:06:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:06:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:06:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 17:06:00,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-11-18 17:06:00,809 INFO L87 Difference]: Start difference. First operand 407 states and 494 transitions. cyclomatic complexity: 105 Second operand 21 states. [2018-11-18 17:06:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:06:01,644 INFO L93 Difference]: Finished difference Result 772 states and 962 transitions. [2018-11-18 17:06:01,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 17:06:01,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 772 states and 962 transitions. [2018-11-18 17:06:01,648 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 267 [2018-11-18 17:06:01,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 772 states to 770 states and 960 transitions. [2018-11-18 17:06:01,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 575 [2018-11-18 17:06:01,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2018-11-18 17:06:01,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 770 states and 960 transitions. [2018-11-18 17:06:01,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 17:06:01,653 INFO L705 BuchiCegarLoop]: Abstraction has 770 states and 960 transitions. [2018-11-18 17:06:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states and 960 transitions. [2018-11-18 17:06:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 419. [2018-11-18 17:06:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-18 17:06:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 506 transitions. [2018-11-18 17:06:01,663 INFO L728 BuchiCegarLoop]: Abstraction has 419 states and 506 transitions. [2018-11-18 17:06:01,663 INFO L608 BuchiCegarLoop]: Abstraction has 419 states and 506 transitions. [2018-11-18 17:06:01,663 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 17:06:01,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 419 states and 506 transitions. [2018-11-18 17:06:01,665 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2018-11-18 17:06:01,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:06:01,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:06:01,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 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, 1] [2018-11-18 17:06:01,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:06:01,667 INFO L794 eck$LassoCheckResult]: Stem: 11249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 11226#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; 11234#L40-4 assume true; 11235#L40-1 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; 11196#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11197#L40-4 assume true; 11212#L40-1 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; 11213#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11271#L40-4 assume true; 11270#L40-1 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; 11268#L40-3 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11264#L40-4 assume true; 11266#L40-1 assume !(main_~i~1 < main_~n~0); 11190#L40-5 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 11233#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11272#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11261#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11262#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11259#L24 assume ~n < 2; 11348#merge_sortFINAL assume true; 11347#merge_sortEXIT >#90#return; 11193#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 11279#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11328#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11329#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11334#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11336#L24 assume ~n < 2; 11331#merge_sortFINAL assume true; 11332#merge_sortEXIT >#90#return; 11256#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 11255#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11257#L24 assume ~n < 2; 11397#merge_sortFINAL assume true; 11394#merge_sortEXIT >#92#return; 11392#L28 assume { :begin_inline_merge } true;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; 11393#L11-4 assume true; 11388#L11-1 assume !!(merge_~k~0 < merge_~n); 11389#L12 assume !(merge_~j~0 == merge_~n); 11384#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); 11385#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; 11410#L14-2 merge_#t~ite14 := merge_#t~ite13; 11408#L13-2 merge_#t~ite15 := merge_#t~ite14; 11406#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 11404#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11403#L11-4 assume true; 11402#L11-1 assume !!(merge_~k~0 < merge_~n); 11399#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; 11400#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 11430#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11429#L11-4 assume true; 11330#L11-1 assume !(merge_~k~0 < merge_~n); 11316#L11-5 merge_~i~0 := 0; 11315#L17-4 assume true; 11314#L17-1 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; 11313#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 11209#L17-4 assume true; 11210#L17-1 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; 11192#L17-3 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 11195#L17-4 assume true; 11273#L17-1 assume !(merge_~i~0 < merge_~n); 11274#L17-5 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 11229#L8 assume { :end_inline_merge } true; 11230#merge_sortFINAL assume true; 11247#merge_sortEXIT >#92#return; 11231#L28 assume { :begin_inline_merge } true;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; 11232#L11-4 assume true; 11574#L11-1 assume !!(merge_~k~0 < merge_~n); 11572#L12 assume !(merge_~j~0 == merge_~n); 11573#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); 11569#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; 11567#L14-2 merge_#t~ite14 := merge_#t~ite13; 11568#L13-2 merge_#t~ite15 := merge_#t~ite14; 11580#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 11579#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11578#L11-4 assume true; 11577#L11-1 assume !!(merge_~k~0 < merge_~n); 11575#L12 [2018-11-18 17:06:01,667 INFO L796 eck$LassoCheckResult]: Loop: 11575#L12 assume !(merge_~j~0 == merge_~n); 11202#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); 11203#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; 11236#L14-2 merge_#t~ite14 := merge_#t~ite13; 11586#L13-2 merge_#t~ite15 := merge_#t~ite14; 11585#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem4;havoc merge_#t~post11;havoc merge_#t~mem12;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~ite15;havoc merge_#t~ite14;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~post3;havoc merge_#t~post9; 11584#L11-3 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11583#L11-4 assume true; 11576#L11-1 assume !!(merge_~k~0 < merge_~n); 11575#L12 [2018-11-18 17:06:01,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:06:01,667 INFO L82 PathProgramCache]: Analyzing trace with hash 824805120, now seen corresponding path program 2 times [2018-11-18 17:06:01,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:06:01,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:06:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:06:01,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:06:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:06:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:06:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:06:01,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:06:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash -483894816, now seen corresponding path program 3 times [2018-11-18 17:06:01,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:06:01,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:06:01,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:06:01,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:06:01,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:06:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:06:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:06:01,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:06:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1233305151, now seen corresponding path program 3 times [2018-11-18 17:06:01,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:06:01,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:06:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:06:01,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:06:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:06:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:06:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:06:01,953 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-18 17:06:03,437 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 265 DAG size of output: 222 [2018-11-18 17:06:04,180 WARN L180 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2018-11-18 17:06:04,417 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-18 17:06:04,607 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-18 17:06:06,489 WARN L180 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 271 DAG size of output: 243 [2018-11-18 17:06:08,172 WARN L180 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 149 DAG size of output: 139 [2018-11-18 17:06:08,298 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-18 17:06:08,742 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2018-11-18 17:06:09,160 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-18 17:06:10,994 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 193 DAG size of output: 187 [2018-11-18 17:06:11,622 WARN L180 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-11-18 17:06:11,624 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:06:11,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:06:11,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:06:11,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:06:11,624 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:06:11,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:06:11,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:06:11,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:06:11,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration16_Lasso [2018-11-18 17:06:11,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:06:11,624 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:06:11,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:11,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:06:12,080 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-18 17:06:12,083 INFO L168 Benchmark]: Toolchain (without parser) took 29355.94 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 746.1 MB). Free memory was 954.4 MB in the beginning and 856.1 MB in the end (delta: 98.3 MB). Peak memory consumption was 885.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:06:12,083 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:06:12,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.44 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:06:12,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.75 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:06:12,084 INFO L168 Benchmark]: Boogie Preprocessor took 70.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:06:12,085 INFO L168 Benchmark]: RCFGBuilder took 332.50 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: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:06:12,085 INFO L168 Benchmark]: BuchiAutomizer took 28729.83 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 613.4 MB). Free memory was 1.1 GB in the beginning and 856.1 MB in the end (delta: 248.0 MB). Peak memory consumption was 902.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:06:12,087 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.44 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.75 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 332.50 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: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28729.83 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 613.4 MB). Free memory was 1.1 GB in the beginning and 856.1 MB in the end (delta: 248.0 MB). Peak memory consumption was 902.8 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...