./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/mergeSort_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-recursive-malloc/mergeSort_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.24-2e94e6a [2019-01-01 22:05:36,901 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:05:36,903 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:05:36,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:05:36,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:05:36,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:05:36,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:05:36,920 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:05:36,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:05:36,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:05:36,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:05:36,924 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:05:36,924 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:05:36,925 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:05:36,927 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:05:36,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:05:36,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:05:36,931 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:05:36,933 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:05:36,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:05:36,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:05:36,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:05:36,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:05:36,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:05:36,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:05:36,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:05:36,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:05:36,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:05:36,957 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:05:36,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:05:36,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:05:36,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:05:36,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:05:36,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:05:36,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:05:36,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:05:36,968 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:05:37,003 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:05:37,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:05:37,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:05:37,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:05:37,005 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:05:37,005 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:05:37,005 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:05:37,005 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:05:37,007 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:05:37,007 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:05:37,007 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:05:37,008 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:05:37,008 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:05:37,009 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:05:37,009 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:05:37,009 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:05:37,009 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:05:37,009 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:05:37,009 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:05:37,010 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:05:37,010 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:05:37,010 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:05:37,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:05:37,010 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:05:37,013 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:05:37,013 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:05:37,014 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:05:37,014 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:05:37,015 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:05:37,015 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-01 22:05:37,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:05:37,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:05:37,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:05:37,112 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:05:37,113 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:05:37,114 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2019-01-01 22:05:37,183 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19eb256e9/d14efdb807b44ea0bbf2da997d1bc0b5/FLAG1a9663de9 [2019-01-01 22:05:37,681 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:05:37,682 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2019-01-01 22:05:37,692 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19eb256e9/d14efdb807b44ea0bbf2da997d1bc0b5/FLAG1a9663de9 [2019-01-01 22:05:38,147 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19eb256e9/d14efdb807b44ea0bbf2da997d1bc0b5 [2019-01-01 22:05:38,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:05:38,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:05:38,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:38,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:05:38,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:05:38,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7840aca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38, skipping insertion in model container [2019-01-01 22:05:38,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:05:38,189 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:05:38,354 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:38,364 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:05:38,388 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:38,410 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:05:38,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38 WrapperNode [2019-01-01 22:05:38,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:38,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:38,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:05:38,412 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:05:38,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:38,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:05:38,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:05:38,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:05:38,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (1/1) ... [2019-01-01 22:05:38,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:05:38,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:05:38,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:05:38,589 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:05:38,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:05:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:05:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2019-01-01 22:05:38,650 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2019-01-01 22:05:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:05:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:05:38,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:05:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:05:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:05:39,206 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:05:39,206 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-01 22:05:39,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:39 BoogieIcfgContainer [2019-01-01 22:05:39,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:05:39,208 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:05:39,208 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:05:39,212 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:05:39,213 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:39,214 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:05:38" (1/3) ... [2019-01-01 22:05:39,215 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@765a4e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:39, skipping insertion in model container [2019-01-01 22:05:39,215 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:39,215 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:38" (2/3) ... [2019-01-01 22:05:39,216 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@765a4e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:39, skipping insertion in model container [2019-01-01 22:05:39,216 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:39,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:39" (3/3) ... [2019-01-01 22:05:39,218 INFO L375 chiAutomizerObserver]: Analyzing ICFG mergeSort_true-termination.c.i [2019-01-01 22:05:39,280 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:05:39,281 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:05:39,281 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:05:39,281 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:05:39,282 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:05:39,282 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:05:39,282 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:05:39,282 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:05:39,282 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:05:39,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2019-01-01 22:05:39,326 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:05:39,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:39,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:39,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:05:39,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:05:39,333 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:05:39,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2019-01-01 22:05:39,337 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:05:39,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:39,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:39,338 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:05:39,338 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:05:39,345 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 30#L35true assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4#L40-3true [2019-01-01 22:05:39,346 INFO L796 eck$LassoCheckResult]: Loop: 4#L40-3true assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 5#L40-2true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4#L40-3true [2019-01-01 22:05:39,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash 88447, now seen corresponding path program 1 times [2019-01-01 22:05:39,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:39,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:39,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:39,473 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2019-01-01 22:05:39,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:39,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:39,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:39,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:39,496 INFO L82 PathProgramCache]: Analyzing trace with hash 84999937, now seen corresponding path program 1 times [2019-01-01 22:05:39,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:39,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:39,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:39,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:39,873 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 22:05:40,017 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 22:05:40,038 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:40,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:40,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:40,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:40,040 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:40,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:40,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:40,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:40,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration1_Lasso [2019-01-01 22:05:40,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:40,041 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:40,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:40,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:40,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:40,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:40,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:40,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:40,374 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-01 22:05:40,735 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:05:41,132 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:41,137 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:41,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:41,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:41,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:41,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:41,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:41,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:41,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:41,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:41,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:41,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:41,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:41,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:41,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:41,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:41,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:41,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:41,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:41,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:41,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:41,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:41,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:41,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:41,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:41,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:41,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:41,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:41,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:41,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:41,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:41,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:41,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:41,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:41,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:41,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:41,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:41,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:41,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:41,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:41,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:41,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:41,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:41,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:41,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:41,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:41,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:41,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:41,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:41,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:41,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:41,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:41,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:41,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:41,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:41,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:41,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:41,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:41,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:41,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:41,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:41,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:41,374 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:05:41,375 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 22:05:41,378 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:41,380 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:41,380 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:41,381 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1) = -4*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1 Supporting invariants [] [2019-01-01 22:05:41,446 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:05:41,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:05:41,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:41,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:41,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:41,635 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 [2019-01-01 22:05:41,636 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 3 states. [2019-01-01 22:05:41,789 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 3 states. Result 59 states and 83 transitions. Complement of second has 9 states. [2019-01-01 22:05:41,790 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 [2019-01-01 22:05:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2019-01-01 22:05:41,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 22:05:41,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:41,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 22:05:41,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:41,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 22:05:41,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:41,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2019-01-01 22:05:41,807 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 22:05:41,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 26 states and 37 transitions. [2019-01-01 22:05:41,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-01 22:05:41,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 22:05:41,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2019-01-01 22:05:41,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:41,820 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-01-01 22:05:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2019-01-01 22:05:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-01 22:05:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 22:05:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-01-01 22:05:41,853 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-01-01 22:05:41,853 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-01-01 22:05:41,853 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:05:41,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2019-01-01 22:05:41,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 22:05:41,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:41,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:41,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:05:41,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:41,856 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 165#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 155#L40-3 assume !(main_~i~1 < main_~n~0); 151#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 169#merge_sortENTRY [2019-01-01 22:05:41,857 INFO L796 eck$LassoCheckResult]: Loop: 169#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 158#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 152#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 169#merge_sortENTRY [2019-01-01 22:05:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash 84999888, now seen corresponding path program 1 times [2019-01-01 22:05:41,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:41,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:41,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:41,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:41,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:41,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:05:41,926 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:05:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2019-01-01 22:05:41,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:41,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:41,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:41,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:41,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:42,143 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 22:05:42,416 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-01-01 22:05:42,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:05:42,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:05:42,421 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-01-01 22:05:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:42,440 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2019-01-01 22:05:42,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:05:42,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-01-01 22:05:42,443 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 22:05:42,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2019-01-01 22:05:42,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 22:05:42,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 22:05:42,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-01-01 22:05:42,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:42,446 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-01 22:05:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-01-01 22:05:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-01 22:05:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 22:05:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-01-01 22:05:42,451 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:05:42,451 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:05:42,451 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:05:42,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2019-01-01 22:05:42,454 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 22:05:42,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:42,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:42,455 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:42,455 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:42,456 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 223#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 224#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 214#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 215#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 216#L40-3 assume !(main_~i~1 < main_~n~0); 211#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 228#merge_sortENTRY [2019-01-01 22:05:42,456 INFO L796 eck$LassoCheckResult]: Loop: 228#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 217#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 209#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 228#merge_sortENTRY [2019-01-01 22:05:42,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:42,456 INFO L82 PathProgramCache]: Analyzing trace with hash 80563154, now seen corresponding path program 1 times [2019-01-01 22:05:42,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:42,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:42,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:42,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:42,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 2 times [2019-01-01 22:05:42,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:42,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:42,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:42,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash -829797441, now seen corresponding path program 1 times [2019-01-01 22:05:42,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:42,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:42,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:42,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:42,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:05:42,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:05:42,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:42,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:42,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:05:42,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 22:05:43,060 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-01-01 22:05:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:05:43,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:05:43,062 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-01-01 22:05:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:43,229 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-01-01 22:05:43,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 22:05:43,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2019-01-01 22:05:43,233 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 22:05:43,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2019-01-01 22:05:43,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 22:05:43,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 22:05:43,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-01-01 22:05:43,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:43,237 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-01-01 22:05:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-01-01 22:05:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-01-01 22:05:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 22:05:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-01 22:05:43,243 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 22:05:43,243 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 22:05:43,243 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:05:43,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-01 22:05:43,244 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 22:05:43,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:43,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:43,245 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-01 22:05:43,245 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:43,245 INFO L794 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 330#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 331#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 320#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 321#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 322#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 323#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 341#L40-3 assume !(main_~i~1 < main_~n~0); 316#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 335#merge_sortENTRY [2019-01-01 22:05:43,245 INFO L796 eck$LassoCheckResult]: Loop: 335#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 324#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 315#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 335#merge_sortENTRY [2019-01-01 22:05:43,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 111829076, now seen corresponding path program 2 times [2019-01-01 22:05:43,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:43,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:43,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:43,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:43,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 3 times [2019-01-01 22:05:43,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:43,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:43,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:43,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:43,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:43,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:43,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1394618371, now seen corresponding path program 2 times [2019-01-01 22:05:43,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:43,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:43,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:43,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:43,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:43,592 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 22:05:43,983 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-01-01 22:05:44,237 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:44,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:44,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:44,238 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:44,238 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:44,238 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:44,238 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:44,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:44,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration4_Lasso [2019-01-01 22:05:44,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:44,239 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:44,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:44,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:45,014 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:45,015 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:45,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:45,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:45,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:45,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:45,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:45,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:45,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:45,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:45,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:45,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:45,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:45,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:45,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:45,133 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:45,150 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:05:45,150 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:05:45,151 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:45,154 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:45,154 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:45,155 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2019-01-01 22:05:45,179 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:05:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:45,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:45,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:46,149 WARN L181 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 12 [2019-01-01 22:05:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:46,151 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 [2019-01-01 22:05:46,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-01 22:05:46,273 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2019-01-01 22:05:46,275 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 [2019-01-01 22:05:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:05:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 22:05:46,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:05:46,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:46,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 22:05:46,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:46,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 22:05:46,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:46,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-01-01 22:05:46,282 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 22:05:46,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 49 transitions. [2019-01-01 22:05:46,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 22:05:46,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 22:05:46,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2019-01-01 22:05:46,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:46,287 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2019-01-01 22:05:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2019-01-01 22:05:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-01-01 22:05:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 22:05:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-01-01 22:05:46,293 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-01-01 22:05:46,293 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-01-01 22:05:46,293 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:05:46,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-01-01 22:05:46,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 22:05:46,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:46,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:46,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:46,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:46,298 INFO L794 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 479#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 480#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 467#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 468#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 469#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 470#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 494#L40-3 assume !(main_~i~1 < main_~n~0); 463#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 484#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 473#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 462#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 490#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 471#L24 assume ~n < 2; 472#L8 assume true; 481#merge_sortEXIT >#86#return; 461#L27-1 [2019-01-01 22:05:46,298 INFO L796 eck$LassoCheckResult]: Loop: 461#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 491#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 493#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 464#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 491#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 493#L24 assume ~n < 2; 477#L8 assume true; 492#merge_sortEXIT >#86#return; 461#L27-1 [2019-01-01 22:05:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:46,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744228, now seen corresponding path program 1 times [2019-01-01 22:05:46,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:46,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:46,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:46,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:46,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:46,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:46,364 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 1 times [2019-01-01 22:05:46,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:46,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:46,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:46,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:46,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:46,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:46,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1064649429, now seen corresponding path program 1 times [2019-01-01 22:05:46,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:46,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:46,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:46,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:46,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:05:46,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:05:46,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:05:46,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:46,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:46,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:05:46,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-01-01 22:05:47,311 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 22:05:47,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 22:05:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-01-01 22:05:47,388 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 13 states. [2019-01-01 22:05:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:47,570 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-01-01 22:05:47,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 22:05:47,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2019-01-01 22:05:47,574 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2019-01-01 22:05:47,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 65 states and 81 transitions. [2019-01-01 22:05:47,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-01 22:05:47,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-01-01 22:05:47,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2019-01-01 22:05:47,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:47,578 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-01-01 22:05:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2019-01-01 22:05:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-01-01 22:05:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 22:05:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-01-01 22:05:47,588 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-01-01 22:05:47,588 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-01-01 22:05:47,588 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:05:47,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2019-01-01 22:05:47,589 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2019-01-01 22:05:47,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:47,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:47,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:47,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:47,592 INFO L794 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 680#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 681#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 663#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 664#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 665#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 666#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 710#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 707#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 706#L40-3 assume !(main_~i~1 < main_~n~0); 670#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 701#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 669#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 671#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 697#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 698#L24 assume ~n < 2; 723#L8 assume true; 720#merge_sortEXIT >#86#return; 674#L27-1 [2019-01-01 22:05:47,592 INFO L796 eck$LassoCheckResult]: Loop: 674#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 699#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 721#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 673#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 699#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 721#L24 assume ~n < 2; 722#L8 assume true; 718#merge_sortEXIT >#86#return; 674#L27-1 [2019-01-01 22:05:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 2 times [2019-01-01 22:05:47,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:47,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:47,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:47,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:47,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 2 times [2019-01-01 22:05:47,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:47,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:47,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:47,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:47,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:47,634 INFO L82 PathProgramCache]: Analyzing trace with hash -889748845, now seen corresponding path program 2 times [2019-01-01 22:05:47,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:47,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:47,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:47,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:47,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:47,789 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:05:47,905 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:05:48,265 WARN L181 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 22:05:48,381 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 22:05:49,161 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-01-01 22:05:49,599 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-01-01 22:05:49,663 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:49,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:49,663 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:49,663 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:49,663 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:49,664 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:49,664 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:49,664 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:49,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration6_Lasso [2019-01-01 22:05:49,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:49,664 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:49,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:49,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:50,489 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:50,489 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:50,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:50,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:50,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:50,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:50,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:50,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,542 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:05:50,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,544 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:05:50,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:50,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:50,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:50,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:50,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:50,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:50,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:50,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:50,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:50,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:50,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:50,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:50,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:50,609 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:50,655 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:05:50,655 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 22:05:50,656 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:50,659 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:50,659 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:50,659 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 [] [2019-01-01 22:05:50,660 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:05:50,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:50,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:50,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:50,879 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 [2019-01-01 22:05:50,879 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23 Second operand 7 states. [2019-01-01 22:05:51,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23. Second operand 7 states. Result 310 states and 425 transitions. Complement of second has 28 states. [2019-01-01 22:05:51,121 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 [2019-01-01 22:05:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 22:05:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2019-01-01 22:05:51,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 8 letters. [2019-01-01 22:05:51,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 26 letters. Loop has 8 letters. [2019-01-01 22:05:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 16 letters. [2019-01-01 22:05:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:51,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 425 transitions. [2019-01-01 22:05:51,134 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2019-01-01 22:05:51,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 227 states and 317 transitions. [2019-01-01 22:05:51,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2019-01-01 22:05:51,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2019-01-01 22:05:51,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 317 transitions. [2019-01-01 22:05:51,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:51,146 INFO L705 BuchiCegarLoop]: Abstraction has 227 states and 317 transitions. [2019-01-01 22:05:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 317 transitions. [2019-01-01 22:05:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 206. [2019-01-01 22:05:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-01 22:05:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 282 transitions. [2019-01-01 22:05:51,171 INFO L728 BuchiCegarLoop]: Abstraction has 206 states and 282 transitions. [2019-01-01 22:05:51,171 INFO L608 BuchiCegarLoop]: Abstraction has 206 states and 282 transitions. [2019-01-01 22:05:51,172 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:05:51,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 282 transitions. [2019-01-01 22:05:51,174 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2019-01-01 22:05:51,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:51,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:51,176 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:51,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:05:51,176 INFO L794 eck$LassoCheckResult]: Stem: 1218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1201#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 1202#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1176#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1177#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1178#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1179#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1180#L40-3 assume !(main_~i~1 < main_~n~0); 1170#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1209#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1266#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1228#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1229#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1348#L24 assume ~n < 2; 1347#L8 assume true; 1342#merge_sortEXIT >#86#return; 1182#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1223#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1181#L24 assume ~n < 2; 1183#L8 assume true; 1203#merge_sortEXIT >#88#return; 1205#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 1206#L11-3 [2019-01-01 22:05:51,176 INFO L796 eck$LassoCheckResult]: Loop: 1206#L11-3 assume !!(merge_~k~0 < merge_~n); 1212#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; 1199#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 1214#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1206#L11-3 [2019-01-01 22:05:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 1 times [2019-01-01 22:05:51,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:51,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:51,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:51,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2019-01-01 22:05:51,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:51,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:51,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:51,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:51,210 INFO L82 PathProgramCache]: Analyzing trace with hash -782974256, now seen corresponding path program 1 times [2019-01-01 22:05:51,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:51,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:51,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:51,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 22:05:51,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:51,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:05:51,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:05:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:05:51,435 INFO L87 Difference]: Start difference. First operand 206 states and 282 transitions. cyclomatic complexity: 100 Second operand 4 states. [2019-01-01 22:05:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:51,499 INFO L93 Difference]: Finished difference Result 319 states and 436 transitions. [2019-01-01 22:05:51,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:05:51,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 436 transitions. [2019-01-01 22:05:51,508 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 134 [2019-01-01 22:05:51,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 319 states and 436 transitions. [2019-01-01 22:05:51,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2019-01-01 22:05:51,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2019-01-01 22:05:51,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 436 transitions. [2019-01-01 22:05:51,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:51,521 INFO L705 BuchiCegarLoop]: Abstraction has 319 states and 436 transitions. [2019-01-01 22:05:51,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 436 transitions. [2019-01-01 22:05:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 260. [2019-01-01 22:05:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-01-01 22:05:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 345 transitions. [2019-01-01 22:05:51,546 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 345 transitions. [2019-01-01 22:05:51,546 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 345 transitions. [2019-01-01 22:05:51,546 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:05:51,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 345 transitions. [2019-01-01 22:05:51,551 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2019-01-01 22:05:51,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:51,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:51,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:51,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:51,554 INFO L794 eck$LassoCheckResult]: Stem: 1770#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1744#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 1745#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1715#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1716#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1717#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 1718#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1719#L40-3 assume !(main_~i~1 < main_~n~0); 1705#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1753#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1822#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1780#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1781#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1841#L24 assume ~n < 2; 1840#L8 assume true; 1839#merge_sortEXIT >#86#return; 1721#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1782#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1720#L24 assume ~n < 2; 1722#L8 assume true; 1765#merge_sortEXIT >#88#return; 1749#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 1750#L11-3 [2019-01-01 22:05:51,554 INFO L796 eck$LassoCheckResult]: Loop: 1750#L11-3 assume !!(merge_~k~0 < merge_~n); 1773#L12 assume !(merge_~j~0 == merge_~n); 1957#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); 1961#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; 1959#L14-2 merge_#t~ite14 := merge_#t~ite13; 1958#L13-2 merge_#t~ite15 := merge_#t~ite14; 1761#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 1762#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1750#L11-3 [2019-01-01 22:05:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:51,555 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 2 times [2019-01-01 22:05:51,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:51,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:51,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:51,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:51,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:51,598 INFO L82 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2019-01-01 22:05:51,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:51,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:51,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash 389830265, now seen corresponding path program 1 times [2019-01-01 22:05:51,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:51,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:51,940 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-01 22:05:52,471 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 117 [2019-01-01 22:05:52,857 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-01-01 22:05:53,047 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-01 22:05:53,523 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 114 [2019-01-01 22:05:53,642 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-01 22:05:53,645 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:53,645 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:53,645 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:53,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:53,646 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:53,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:53,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:53,646 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:53,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration8_Lasso [2019-01-01 22:05:53,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:53,646 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:53,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:53,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:53,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:53,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:53,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:53,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:53,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:53,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:53,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:53,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,116 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2019-01-01 22:05:54,349 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-01-01 22:05:54,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:54,864 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-01-01 22:05:55,267 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-01-01 22:05:55,526 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-01 22:05:55,784 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2019-01-01 22:05:55,878 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:55,879 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:55,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:55,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:55,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:55,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:55,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:55,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:55,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:55,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:55,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:55,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:55,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:55,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:55,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:55,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:55,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:55,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:55,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:55,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:55,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:55,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:55,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:55,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:55,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:55,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:55,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:55,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:55,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:55,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:55,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:55,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:55,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:55,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:55,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:55,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:55,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:55,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:55,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:55,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:55,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:55,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:55,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:55,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:55,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:55,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:55,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:55,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:55,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:55,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:55,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:55,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:55,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:55,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:55,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:55,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:55,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:55,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:55,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:55,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:55,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:55,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:55,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:55,936 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-01 22:05:55,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,017 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2019-01-01 22:05:56,017 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-01-01 22:05:58,856 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:59,625 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-01 22:05:59,625 INFO L444 ModelExtractionUtils]: 179 out of 208 variables were initially zero. Simplification set additionally 25 variables to zero. [2019-01-01 22:05:59,627 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:59,630 INFO L440 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2019-01-01 22:05:59,631 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:59,631 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, merge_sort_merge_~i~0, v_rep(select #length merge_sort_merge_~a.base)_1) = -1*merge_sort_merge_~a.offset - 4*merge_sort_merge_~i~0 + 1*v_rep(select #length merge_sort_merge_~a.base)_1 Supporting invariants [] [2019-01-01 22:05:59,911 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 22:05:59,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:05:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:00,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:00,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:00,133 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 [2019-01-01 22:06:00,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 345 transitions. cyclomatic complexity: 109 Second operand 6 states. [2019-01-01 22:06:00,282 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 345 transitions. cyclomatic complexity: 109. Second operand 6 states. Result 648 states and 877 transitions. Complement of second has 14 states. [2019-01-01 22:06:00,285 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 [2019-01-01 22:06:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 22:06:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2019-01-01 22:06:00,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 22 letters. Loop has 8 letters. [2019-01-01 22:06:00,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:00,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 30 letters. Loop has 8 letters. [2019-01-01 22:06:00,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:00,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 22 letters. Loop has 16 letters. [2019-01-01 22:06:00,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:00,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 648 states and 877 transitions. [2019-01-01 22:06:00,315 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 180 [2019-01-01 22:06:00,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 648 states to 632 states and 845 transitions. [2019-01-01 22:06:00,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2019-01-01 22:06:00,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 334 [2019-01-01 22:06:00,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 632 states and 845 transitions. [2019-01-01 22:06:00,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:00,341 INFO L705 BuchiCegarLoop]: Abstraction has 632 states and 845 transitions. [2019-01-01 22:06:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states and 845 transitions. [2019-01-01 22:06:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 464. [2019-01-01 22:06:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-01-01 22:06:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 637 transitions. [2019-01-01 22:06:00,403 INFO L728 BuchiCegarLoop]: Abstraction has 464 states and 637 transitions. [2019-01-01 22:06:00,403 INFO L608 BuchiCegarLoop]: Abstraction has 464 states and 637 transitions. [2019-01-01 22:06:00,403 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:06:00,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 464 states and 637 transitions. [2019-01-01 22:06:00,410 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 144 [2019-01-01 22:06:00,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:00,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:00,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:00,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:06:00,413 INFO L794 eck$LassoCheckResult]: Stem: 2864#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2834#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 2835#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 2791#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 2792#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2793#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 2794#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2795#L40-3 assume !(main_~i~1 < main_~n~0); 2782#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 2848#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2917#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 2914#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 2913#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2915#L24 assume ~n < 2; 2921#L8 assume true; 2918#merge_sortEXIT >#86#return; 2919#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 2988#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2990#L24 assume ~n < 2; 2989#L8 assume true; 2985#merge_sortEXIT >#88#return; 2983#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 2984#L11-3 assume !!(merge_~k~0 < merge_~n); 2981#L12 [2019-01-01 22:06:00,413 INFO L796 eck$LassoCheckResult]: Loop: 2981#L12 assume !(merge_~j~0 == merge_~n); 3011#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; 3009#L13-2 merge_#t~ite15 := merge_#t~ite14; 2993#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 2982#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 2980#L11-3 assume !!(merge_~k~0 < merge_~n); 2981#L12 [2019-01-01 22:06:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:00,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 1 times [2019-01-01 22:06:00,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:00,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:00,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:00,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:00,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1482376367, now seen corresponding path program 1 times [2019-01-01 22:06:00,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:00,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash 426493234, now seen corresponding path program 1 times [2019-01-01 22:06:00,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:00,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 22:06:00,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:06:00,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:06:00,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:06:00,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:06:00,679 INFO L87 Difference]: Start difference. First operand 464 states and 637 transitions. cyclomatic complexity: 214 Second operand 4 states. [2019-01-01 22:06:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:00,837 INFO L93 Difference]: Finished difference Result 641 states and 857 transitions. [2019-01-01 22:06:00,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:06:00,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 641 states and 857 transitions. [2019-01-01 22:06:00,850 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 210 [2019-01-01 22:06:00,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 641 states to 641 states and 857 transitions. [2019-01-01 22:06:00,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2019-01-01 22:06:00,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2019-01-01 22:06:00,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 641 states and 857 transitions. [2019-01-01 22:06:00,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:00,863 INFO L705 BuchiCegarLoop]: Abstraction has 641 states and 857 transitions. [2019-01-01 22:06:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states and 857 transitions. [2019-01-01 22:06:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 632. [2019-01-01 22:06:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-01-01 22:06:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 848 transitions. [2019-01-01 22:06:00,891 INFO L728 BuchiCegarLoop]: Abstraction has 632 states and 848 transitions. [2019-01-01 22:06:00,891 INFO L608 BuchiCegarLoop]: Abstraction has 632 states and 848 transitions. [2019-01-01 22:06:00,892 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:06:00,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 632 states and 848 transitions. [2019-01-01 22:06:00,899 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 210 [2019-01-01 22:06:00,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:00,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:00,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:00,901 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:00,903 INFO L794 eck$LassoCheckResult]: Stem: 3973#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3941#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 3942#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 3907#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 3908#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3909#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 3910#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3911#L40-3 assume !(main_~i~1 < main_~n~0); 3898#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 3954#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4043#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4038#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4039#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4044#L24 assume ~n < 2; 4042#L8 assume true; 4037#merge_sortEXIT >#86#return; 4033#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 4034#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4041#L24 assume ~n < 2; 4036#L8 assume true; 4032#merge_sortEXIT >#88#return; 4028#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 4029#L11-3 assume !!(merge_~k~0 < merge_~n); 4026#L12 [2019-01-01 22:06:00,903 INFO L796 eck$LassoCheckResult]: Loop: 4026#L12 assume !(merge_~j~0 == merge_~n); 4063#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); 4059#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; 4054#L14-2 merge_#t~ite14 := merge_#t~ite13; 4051#L13-2 merge_#t~ite15 := merge_#t~ite14; 4052#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 4027#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 4025#L11-3 assume !!(merge_~k~0 < merge_~n); 4026#L12 [2019-01-01 22:06:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 2 times [2019-01-01 22:06:00,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:00,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:00,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:00,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:00,932 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2019-01-01 22:06:00,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:00,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash -857421960, now seen corresponding path program 1 times [2019-01-01 22:06:00,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:00,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:01,394 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-01-01 22:06:01,992 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2019-01-01 22:06:02,160 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-01 22:06:02,379 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-01-01 22:06:02,927 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 117 [2019-01-01 22:06:03,062 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-01-01 22:06:03,066 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:03,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:03,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:03,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:03,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:03,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:03,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:03,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:03,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration10_Lasso [2019-01-01 22:06:03,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:03,068 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:03,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,553 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 109 [2019-01-01 22:06:03,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:03,833 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-01 22:06:04,175 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-01 22:06:04,442 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-01 22:06:04,769 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2019-01-01 22:06:04,871 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:04,871 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:04,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:04,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:04,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:04,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:04,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,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 [2019-01-01 22:06:04,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,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 [2019-01-01 22:06:04,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,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 [2019-01-01 22:06:04,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,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 [2019-01-01 22:06:04,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:04,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:04,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:04,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:04,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:04,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:04,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:04,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:04,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:04,969 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-01 22:06:04,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,028 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2019-01-01 22:06:05,028 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-01-01 22:06:06,431 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:07,630 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-01-01 22:06:07,630 INFO L444 ModelExtractionUtils]: 182 out of 208 variables were initially zero. Simplification set additionally 22 variables to zero. [2019-01-01 22:06:07,631 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:07,635 INFO L440 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2019-01-01 22:06:07,636 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:07,636 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~x~0.offset, v_rep(select #length merge_sort_merge_~x~0.base)_2, merge_sort_merge_~k~0) = -1*merge_sort_merge_~x~0.offset + 1*v_rep(select #length merge_sort_merge_~x~0.base)_2 - 4*merge_sort_merge_~k~0 Supporting invariants [] [2019-01-01 22:06:07,925 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 22:06:07,942 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:06:08,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:08,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:08,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:08,128 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 [2019-01-01 22:06:08,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 632 states and 848 transitions. cyclomatic complexity: 265 Second operand 6 states. [2019-01-01 22:06:08,297 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 632 states and 848 transitions. cyclomatic complexity: 265. Second operand 6 states. Result 1427 states and 1961 transitions. Complement of second has 14 states. [2019-01-01 22:06:08,301 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 [2019-01-01 22:06:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 22:06:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2019-01-01 22:06:08,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 23 letters. Loop has 8 letters. [2019-01-01 22:06:08,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:08,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 31 letters. Loop has 8 letters. [2019-01-01 22:06:08,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:08,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 23 letters. Loop has 16 letters. [2019-01-01 22:06:08,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:08,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1427 states and 1961 transitions. [2019-01-01 22:06:08,332 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 162 [2019-01-01 22:06:08,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1427 states to 976 states and 1358 transitions. [2019-01-01 22:06:08,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 364 [2019-01-01 22:06:08,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2019-01-01 22:06:08,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 976 states and 1358 transitions. [2019-01-01 22:06:08,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:08,351 INFO L705 BuchiCegarLoop]: Abstraction has 976 states and 1358 transitions. [2019-01-01 22:06:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states and 1358 transitions. [2019-01-01 22:06:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 959. [2019-01-01 22:06:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-01-01 22:06:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1339 transitions. [2019-01-01 22:06:08,470 INFO L728 BuchiCegarLoop]: Abstraction has 959 states and 1339 transitions. [2019-01-01 22:06:08,470 INFO L608 BuchiCegarLoop]: Abstraction has 959 states and 1339 transitions. [2019-01-01 22:06:08,470 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 22:06:08,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 959 states and 1339 transitions. [2019-01-01 22:06:08,478 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 154 [2019-01-01 22:06:08,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:08,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:08,481 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:08,481 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:06:08,483 INFO L794 eck$LassoCheckResult]: Stem: 6205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6163#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 6164#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 6138#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 6139#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6140#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 6141#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6142#L40-3 assume !(main_~i~1 < main_~n~0); 6129#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 6186#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6270#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6221#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6222#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6489#L24 assume ~n < 2; 6488#L8 assume true; 6485#merge_sortEXIT >#86#return; 6217#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6216#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6218#L24 assume ~n < 2; 6569#L8 assume true; 6568#merge_sortEXIT >#88#return; 6298#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 6567#L11-3 assume !(merge_~k~0 < merge_~n); 6562#L11-4 merge_~i~0 := 0; 6128#L17-3 [2019-01-01 22:06:08,483 INFO L796 eck$LassoCheckResult]: Loop: 6128#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 6131#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 6128#L17-3 [2019-01-01 22:06:08,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:08,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1013709224, now seen corresponding path program 1 times [2019-01-01 22:06:08,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:08,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:08,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:08,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 22:06:08,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:06:08,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:06:08,550 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:06:08,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:08,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2019-01-01 22:06:08,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:08,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:08,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:08,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:08,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:06:08,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:06:08,678 INFO L87 Difference]: Start difference. First operand 959 states and 1339 transitions. cyclomatic complexity: 455 Second operand 4 states. [2019-01-01 22:06:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:08,720 INFO L93 Difference]: Finished difference Result 904 states and 1141 transitions. [2019-01-01 22:06:08,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:06:08,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 904 states and 1141 transitions. [2019-01-01 22:06:08,740 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 132 [2019-01-01 22:06:08,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 904 states to 904 states and 1141 transitions. [2019-01-01 22:06:08,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 328 [2019-01-01 22:06:08,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2019-01-01 22:06:08,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 904 states and 1141 transitions. [2019-01-01 22:06:08,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:08,753 INFO L705 BuchiCegarLoop]: Abstraction has 904 states and 1141 transitions. [2019-01-01 22:06:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states and 1141 transitions. [2019-01-01 22:06:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 680. [2019-01-01 22:06:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-01-01 22:06:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 894 transitions. [2019-01-01 22:06:08,782 INFO L728 BuchiCegarLoop]: Abstraction has 680 states and 894 transitions. [2019-01-01 22:06:08,783 INFO L608 BuchiCegarLoop]: Abstraction has 680 states and 894 transitions. [2019-01-01 22:06:08,783 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 22:06:08,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 680 states and 894 transitions. [2019-01-01 22:06:08,790 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 132 [2019-01-01 22:06:08,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:08,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:08,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:08,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:06:08,794 INFO L794 eck$LassoCheckResult]: Stem: 8075#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8045#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 8046#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 8015#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8016#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8017#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8018#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8019#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 8095#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8094#L40-3 assume !(main_~i~1 < main_~n~0); 8002#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 8107#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8106#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8090#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8091#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8108#L24 assume ~n < 2; 8114#L8 assume true; 8113#merge_sortEXIT >#86#return; 8037#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8111#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8105#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8032#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8131#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8132#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8205#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8213#merge_sortENTRY [2019-01-01 22:06:08,794 INFO L796 eck$LassoCheckResult]: Loop: 8213#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8214#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8203#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8213#merge_sortENTRY [2019-01-01 22:06:08,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:08,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1495319133, now seen corresponding path program 3 times [2019-01-01 22:06:08,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:08,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:08,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:08,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 22:06:08,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:06:08,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:06:08,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:06:08,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 22:06:08,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:06:08,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:09,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:06:09,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2019-01-01 22:06:09,204 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:06:09,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 4 times [2019-01-01 22:06:09,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:09,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:09,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:09,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:09,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:09,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 22:06:09,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-01-01 22:06:09,475 INFO L87 Difference]: Start difference. First operand 680 states and 894 transitions. cyclomatic complexity: 268 Second operand 18 states. [2019-01-01 22:06:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:10,568 INFO L93 Difference]: Finished difference Result 409 states and 523 transitions. [2019-01-01 22:06:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 22:06:10,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 523 transitions. [2019-01-01 22:06:10,573 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 122 [2019-01-01 22:06:10,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 401 states and 515 transitions. [2019-01-01 22:06:10,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2019-01-01 22:06:10,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2019-01-01 22:06:10,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 515 transitions. [2019-01-01 22:06:10,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:10,579 INFO L705 BuchiCegarLoop]: Abstraction has 401 states and 515 transitions. [2019-01-01 22:06:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 515 transitions. [2019-01-01 22:06:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 267. [2019-01-01 22:06:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-01-01 22:06:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 335 transitions. [2019-01-01 22:06:10,594 INFO L728 BuchiCegarLoop]: Abstraction has 267 states and 335 transitions. [2019-01-01 22:06:10,594 INFO L608 BuchiCegarLoop]: Abstraction has 267 states and 335 transitions. [2019-01-01 22:06:10,594 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 22:06:10,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 267 states and 335 transitions. [2019-01-01 22:06:10,600 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2019-01-01 22:06:10,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:10,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:10,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:10,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:06:10,601 INFO L794 eck$LassoCheckResult]: Stem: 9261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9239#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 9240#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 9214#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 9215#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9216#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 9217#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9280#L40-3 assume !(main_~i~1 < main_~n~0); 9213#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 9247#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9408#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9295#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9307#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9305#L24 assume ~n < 2; 9294#L8 assume true; 9296#merge_sortEXIT >#86#return; 9221#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 9275#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9220#L24 assume ~n < 2; 9222#L8 assume true; 9463#merge_sortEXIT >#88#return; 9348#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 9461#L11-3 assume !!(merge_~k~0 < merge_~n); 9460#L12 assume !(merge_~j~0 == merge_~n); 9456#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); 9250#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; 9251#L14-2 merge_#t~ite14 := merge_#t~ite13; 9451#L13-2 merge_#t~ite15 := merge_#t~ite14; 9452#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 9441#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 9442#L11-3 assume !(merge_~k~0 < merge_~n); 9366#L11-4 merge_~i~0 := 0; 9209#L17-3 [2019-01-01 22:06:10,601 INFO L796 eck$LassoCheckResult]: Loop: 9209#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 9211#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 9209#L17-3 [2019-01-01 22:06:10,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:10,601 INFO L82 PathProgramCache]: Analyzing trace with hash -810277004, now seen corresponding path program 1 times [2019-01-01 22:06:10,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:10,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:10,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:10,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:10,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 22:06:10,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:06:10,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:06:10,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:10,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 22:06:10,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:06:10,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-01 22:06:10,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:06:10,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:10,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2019-01-01 22:06:10,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:10,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:10,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:10,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:10,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:10,988 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 22:06:11,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:06:11,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:06:11,013 INFO L87 Difference]: Start difference. First operand 267 states and 335 transitions. cyclomatic complexity: 87 Second operand 7 states. [2019-01-01 22:06:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:11,085 INFO L93 Difference]: Finished difference Result 485 states and 585 transitions. [2019-01-01 22:06:11,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 22:06:11,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 485 states and 585 transitions. [2019-01-01 22:06:11,092 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2019-01-01 22:06:11,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 485 states to 485 states and 585 transitions. [2019-01-01 22:06:11,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 211 [2019-01-01 22:06:11,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2019-01-01 22:06:11,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 485 states and 585 transitions. [2019-01-01 22:06:11,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:11,098 INFO L705 BuchiCegarLoop]: Abstraction has 485 states and 585 transitions. [2019-01-01 22:06:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 585 transitions. [2019-01-01 22:06:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 333. [2019-01-01 22:06:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-01 22:06:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 409 transitions. [2019-01-01 22:06:11,112 INFO L728 BuchiCegarLoop]: Abstraction has 333 states and 409 transitions. [2019-01-01 22:06:11,112 INFO L608 BuchiCegarLoop]: Abstraction has 333 states and 409 transitions. [2019-01-01 22:06:11,112 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 22:06:11,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 409 transitions. [2019-01-01 22:06:11,120 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2019-01-01 22:06:11,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:11,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:11,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:11,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:06:11,121 INFO L794 eck$LassoCheckResult]: Stem: 10125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10101#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 10102#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 10075#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 10076#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10077#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 10078#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10079#L40-3 assume !(main_~i~1 < main_~n~0); 10072#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 10109#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10213#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 10210#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 10211#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10214#L24 assume ~n < 2; 10212#L8 assume true; 10209#merge_sortEXIT >#86#return; 10195#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 10196#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10215#L24 assume ~n < 2; 10197#L8 assume true; 10198#merge_sortEXIT >#88#return; 10192#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 10190#L11-3 assume !!(merge_~k~0 < merge_~n); 10189#L12 assume !(merge_~j~0 == merge_~n); 10188#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); 10187#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; 10171#L14-2 merge_#t~ite14 := merge_#t~ite13; 10360#L13-2 merge_#t~ite15 := merge_#t~ite14; 10121#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 10122#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10157#L11-3 assume !!(merge_~k~0 < merge_~n); 10158#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; 10153#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 10151#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10152#L11-3 assume !(merge_~k~0 < merge_~n); 10147#L11-4 merge_~i~0 := 0; 10070#L17-3 [2019-01-01 22:06:11,121 INFO L796 eck$LassoCheckResult]: Loop: 10070#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 10074#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 10070#L17-3 [2019-01-01 22:06:11,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash 64206937, now seen corresponding path program 1 times [2019-01-01 22:06:11,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:11,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:11,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:11,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2019-01-01 22:06:11,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:11,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:11,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:11,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:11,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1573325915, now seen corresponding path program 1 times [2019-01-01 22:06:11,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:11,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:11,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:11,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:11,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:11,443 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 22:06:11,673 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 22:06:11,797 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:06:11,910 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:06:12,947 WARN L181 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 198 [2019-01-01 22:06:13,544 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-01-01 22:06:13,714 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-01-01 22:06:13,935 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-01-01 22:06:14,096 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-01 22:06:14,600 WARN L181 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 137 [2019-01-01 22:06:14,806 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-01-01 22:06:14,809 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:14,809 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:14,809 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:14,810 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:14,810 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:14,810 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:14,810 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:14,810 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:14,810 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration14_Lasso [2019-01-01 22:06:14,810 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:14,810 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:14,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:14,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,481 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 122 [2019-01-01 22:06:15,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:15,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:16,083 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-01-01 22:06:16,443 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2019-01-01 22:06:16,693 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:16,693 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:16,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:16,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:16,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:16,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:16,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,765 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:06:16,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,770 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:06:16,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:16,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:16,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:16,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:16,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:16,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:16,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:16,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:16,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:16,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:16,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:16,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:16,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:16,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:16,877 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:16,926 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:06:16,926 INFO L444 ModelExtractionUtils]: 62 out of 70 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 22:06:16,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:16,929 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:16,930 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:16,930 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, v_rep(select #length merge_sort_merge_~a.base)_3, merge_sort_merge_~i~0) = -1*merge_sort_merge_~a.offset + 1*v_rep(select #length merge_sort_merge_~a.base)_3 - 4*merge_sort_merge_~i~0 Supporting invariants [] [2019-01-01 22:06:17,381 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-01-01 22:06:17,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:06:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:17,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:17,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:17,590 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 [2019-01-01 22:06:17,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 333 states and 409 transitions. cyclomatic complexity: 95 Second operand 4 states. [2019-01-01 22:06:17,654 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 333 states and 409 transitions. cyclomatic complexity: 95. Second operand 4 states. Result 345 states and 428 transitions. Complement of second has 12 states. [2019-01-01 22:06:17,656 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 [2019-01-01 22:06:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:06:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-01-01 22:06:17,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 2 letters. [2019-01-01 22:06:17,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:17,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 38 letters. Loop has 2 letters. [2019-01-01 22:06:17,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:17,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 4 letters. [2019-01-01 22:06:17,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:17,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 428 transitions. [2019-01-01 22:06:17,669 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2019-01-01 22:06:17,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 264 states and 327 transitions. [2019-01-01 22:06:17,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-01-01 22:06:17,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2019-01-01 22:06:17,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 327 transitions. [2019-01-01 22:06:17,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:17,673 INFO L705 BuchiCegarLoop]: Abstraction has 264 states and 327 transitions. [2019-01-01 22:06:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 327 transitions. [2019-01-01 22:06:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-01-01 22:06:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-01 22:06:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 327 transitions. [2019-01-01 22:06:17,687 INFO L728 BuchiCegarLoop]: Abstraction has 264 states and 327 transitions. [2019-01-01 22:06:17,687 INFO L608 BuchiCegarLoop]: Abstraction has 264 states and 327 transitions. [2019-01-01 22:06:17,687 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 22:06:17,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 327 transitions. [2019-01-01 22:06:17,692 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2019-01-01 22:06:17,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:17,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:17,696 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:17,696 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:17,696 INFO L794 eck$LassoCheckResult]: Stem: 11010#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10978#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 10979#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 10959#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 10960#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10961#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 10962#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11029#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 11026#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11027#L40-3 assume !(main_~i~1 < main_~n~0); 10985#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 10990#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11036#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11006#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11040#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11016#L24 assume ~n < 2; 11043#L8 assume true; 11005#merge_sortEXIT >#86#return; 10955#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 11049#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11050#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11038#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11051#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11052#L24 assume ~n < 2; 11037#L8 assume true; 11039#merge_sortEXIT >#86#return; 11019#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 11020#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11109#L24 assume ~n < 2; 11108#L8 assume true; 11107#merge_sortEXIT >#88#return; 11106#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 11104#L11-3 assume !!(merge_~k~0 < merge_~n); 11103#L12 assume !(merge_~j~0 == merge_~n); 11098#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); 11099#L14 assume merge_#t~mem7 < merge_#t~mem8;merge_#t~post9 := merge_~j~0;merge_~j~0 := 1 + merge_#t~post9;call merge_#t~mem10 := read~int(merge_~a.base, merge_~a.offset + 4 * merge_#t~post9, 4);merge_#t~ite13 := merge_#t~mem10; 11080#L14-2 merge_#t~ite14 := merge_#t~ite13; 11078#L13-2 merge_#t~ite15 := merge_#t~ite14; 11079#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 11067#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11068#L11-3 assume !!(merge_~k~0 < merge_~n); 11059#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; 11057#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 11056#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11055#L11-3 assume !(merge_~k~0 < merge_~n); 11046#L11-4 merge_~i~0 := 0; 11021#L17-3 assume !(merge_~i~0 < merge_~n); 10957#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 10968#L8 assume true; 10980#merge_sortEXIT >#88#return; 11035#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 11189#L11-3 assume !!(merge_~k~0 < merge_~n); 11188#L12 assume !(merge_~j~0 == merge_~n); 11186#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); 11182#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; 11180#L14-2 merge_#t~ite14 := merge_#t~ite13; 11178#L13-2 merge_#t~ite15 := merge_#t~ite14; 11176#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 11174#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11171#L11-3 assume !!(merge_~k~0 < merge_~n); 11172#L12 [2019-01-01 22:06:17,696 INFO L796 eck$LassoCheckResult]: Loop: 11172#L12 assume !(merge_~j~0 == merge_~n); 11187#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); 11184#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; 11185#L14-2 merge_#t~ite14 := merge_#t~ite13; 11194#L13-2 merge_#t~ite15 := merge_#t~ite14; 11196#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 11195#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11173#L11-3 assume !!(merge_~k~0 < merge_~n); 11172#L12 [2019-01-01 22:06:17,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1719261906, now seen corresponding path program 1 times [2019-01-01 22:06:17,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:17,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:17,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:17,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:17,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-01 22:06:17,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:06:17,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:06:17,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:18,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 22:06:18,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:06:18,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2019-01-01 22:06:18,271 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:06:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:18,272 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2019-01-01 22:06:18,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:18,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:18,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:18,561 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-01-01 22:06:18,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 22:06:18,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-01-01 22:06:18,610 INFO L87 Difference]: Start difference. First operand 264 states and 327 transitions. cyclomatic complexity: 78 Second operand 20 states. [2019-01-01 22:06:19,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:19,774 INFO L93 Difference]: Finished difference Result 445 states and 542 transitions. [2019-01-01 22:06:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 22:06:19,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 445 states and 542 transitions. [2019-01-01 22:06:19,779 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 124 [2019-01-01 22:06:19,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 445 states to 439 states and 536 transitions. [2019-01-01 22:06:19,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2019-01-01 22:06:19,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2019-01-01 22:06:19,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 439 states and 536 transitions. [2019-01-01 22:06:19,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:19,783 INFO L705 BuchiCegarLoop]: Abstraction has 439 states and 536 transitions. [2019-01-01 22:06:19,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 536 transitions. [2019-01-01 22:06:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 305. [2019-01-01 22:06:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-01 22:06:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2019-01-01 22:06:19,791 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 376 transitions. [2019-01-01 22:06:19,791 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 376 transitions. [2019-01-01 22:06:19,791 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-01 22:06:19,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 376 transitions. [2019-01-01 22:06:19,792 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2019-01-01 22:06:19,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:19,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:19,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:19,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:19,794 INFO L794 eck$LassoCheckResult]: Stem: 11953#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11930#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 11931#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 11909#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 11910#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11972#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 11973#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11911#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 11912#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11913#L40-3 assume !(main_~i~1 < main_~n~0); 11902#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 11939#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 12007#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11967#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11968#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11966#L24 assume ~n < 2; 12025#L8 assume true; 12024#merge_sortEXIT >#86#return; 11905#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 11991#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11980#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11981#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 12014#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 12019#L24 assume ~n < 2; 12009#L8 assume true; 12010#merge_sortEXIT >#86#return; 11915#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 11969#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11914#L24 assume ~n < 2; 11916#L8 assume true; 12105#merge_sortEXIT >#88#return; 12104#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 12102#L11-3 assume !!(merge_~k~0 < merge_~n); 12101#L12 assume !(merge_~j~0 == merge_~n); 12100#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); 12099#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; 11947#L14-2 merge_#t~ite14 := merge_#t~ite13; 11928#L13-2 merge_#t~ite15 := merge_#t~ite14; 11929#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 11955#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11956#L11-3 assume !!(merge_~k~0 < merge_~n); 12038#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; 12036#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 12033#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 12034#L11-3 assume !(merge_~k~0 < merge_~n); 11990#L11-4 merge_~i~0 := 0; 11977#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 11908#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 11904#L17-3 assume !(merge_~i~0 < merge_~n); 11907#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 11932#L8 assume true; 11933#merge_sortEXIT >#88#return; 11934#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 11935#L11-3 assume !!(merge_~k~0 < merge_~n); 12194#L12 assume !(merge_~j~0 == merge_~n); 12193#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); 12191#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; 12190#L14-2 merge_#t~ite14 := merge_#t~ite13; 12189#L13-2 merge_#t~ite15 := merge_#t~ite14; 12188#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 12186#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 12187#L11-3 assume !!(merge_~k~0 < merge_~n); 11943#L12 [2019-01-01 22:06:19,794 INFO L796 eck$LassoCheckResult]: Loop: 11943#L12 assume !(merge_~j~0 == merge_~n); 11919#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); 11920#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; 11940#L14-2 merge_#t~ite14 := merge_#t~ite13; 11926#L13-2 merge_#t~ite15 := merge_#t~ite14; 11927#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 11948#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11954#L11-3 assume !!(merge_~k~0 < merge_~n); 11943#L12 [2019-01-01 22:06:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2004988308, now seen corresponding path program 1 times [2019-01-01 22:06:19,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:19,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:19,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-01 22:06:20,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:06:20,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:06:20,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:20,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-01 22:06:20,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:06:20,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2019-01-01 22:06:20,287 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:06:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2019-01-01 22:06:20,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:20,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:20,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:20,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:20,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:20,619 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-01-01 22:06:20,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 22:06:20,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-01-01 22:06:20,664 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. cyclomatic complexity: 88 Second operand 21 states. [2019-01-01 22:06:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:22,419 INFO L93 Difference]: Finished difference Result 655 states and 812 transitions. [2019-01-01 22:06:22,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 22:06:22,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 655 states and 812 transitions. [2019-01-01 22:06:22,426 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 208 [2019-01-01 22:06:22,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 655 states to 655 states and 812 transitions. [2019-01-01 22:06:22,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 414 [2019-01-01 22:06:22,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 414 [2019-01-01 22:06:22,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 655 states and 812 transitions. [2019-01-01 22:06:22,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:22,431 INFO L705 BuchiCegarLoop]: Abstraction has 655 states and 812 transitions. [2019-01-01 22:06:22,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states and 812 transitions. [2019-01-01 22:06:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 313. [2019-01-01 22:06:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-01-01 22:06:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 384 transitions. [2019-01-01 22:06:22,441 INFO L728 BuchiCegarLoop]: Abstraction has 313 states and 384 transitions. [2019-01-01 22:06:22,441 INFO L608 BuchiCegarLoop]: Abstraction has 313 states and 384 transitions. [2019-01-01 22:06:22,441 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-01 22:06:22,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 384 transitions. [2019-01-01 22:06:22,443 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2019-01-01 22:06:22,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:22,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:22,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:22,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:22,450 INFO L794 eck$LassoCheckResult]: Stem: 13171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13151#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 13152#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 13128#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 13129#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13186#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 13187#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13130#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 13131#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13189#L40-3 assume !(main_~i~1 < main_~n~0); 13121#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 13157#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13222#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 13183#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 13184#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13182#L24 assume ~n < 2; 13241#L8 assume true; 13240#merge_sortEXIT >#86#return; 13142#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 13215#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13234#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 13218#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 13219#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13233#L24 assume ~n < 2; 13232#L8 assume true; 13217#merge_sortEXIT >#86#return; 13135#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 13185#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13134#L24 assume ~n < 2; 13136#L8 assume true; 13153#merge_sortEXIT >#88#return; 13309#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 13324#L11-3 assume !!(merge_~k~0 < merge_~n); 13323#L12 assume !(merge_~j~0 == merge_~n); 13322#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); 13321#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; 13280#L14-2 merge_#t~ite14 := merge_#t~ite13; 13340#L13-2 merge_#t~ite15 := merge_#t~ite14; 13339#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 13337#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13267#L11-3 assume !!(merge_~k~0 < merge_~n); 13262#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; 13260#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 13258#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13259#L11-3 assume !(merge_~k~0 < merge_~n); 13202#L11-4 merge_~i~0 := 0; 13203#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 13198#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 13199#L17-3 assume !!(merge_~i~0 < merge_~n);call merge_#t~mem17 := read~int(merge_~x~0.base, merge_~x~0.offset + 4 * merge_~i~0, 4);call write~int(merge_#t~mem17, merge_~a.base, merge_~a.offset + 4 * merge_~i~0, 4);havoc merge_#t~mem17; 13194#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 13192#L17-3 assume !(merge_~i~0 < merge_~n); 13193#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 13310#L8 assume true; 13308#merge_sortEXIT >#88#return; 13154#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 13155#L11-3 assume !!(merge_~k~0 < merge_~n); 13421#L12 assume !(merge_~j~0 == merge_~n); 13420#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); 13418#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; 13417#L14-2 merge_#t~ite14 := merge_#t~ite13; 13416#L13-2 merge_#t~ite15 := merge_#t~ite14; 13415#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 13172#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13173#L11-3 assume !!(merge_~k~0 < merge_~n); 13161#L12 [2019-01-01 22:06:22,450 INFO L796 eck$LassoCheckResult]: Loop: 13161#L12 assume !(merge_~j~0 == merge_~n); 13138#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); 13139#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; 13158#L14-2 merge_#t~ite14 := merge_#t~ite13; 13429#L13-2 merge_#t~ite15 := merge_#t~ite14; 13428#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~ite13;havoc merge_#t~ite15;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~post9;havoc merge_#t~ite14;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~post11; 13427#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13423#L11-3 assume !!(merge_~k~0 < merge_~n); 13161#L12 [2019-01-01 22:06:22,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1710153686, now seen corresponding path program 2 times [2019-01-01 22:06:22,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:22,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:22,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 4 times [2019-01-01 22:06:22,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:22,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:22,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:22,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:22,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:22,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1618831734, now seen corresponding path program 3 times [2019-01-01 22:06:22,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:22,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:22,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:22,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:22,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,447 WARN L181 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-01-01 22:06:25,559 WARN L181 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 267 DAG size of output: 225 [2019-01-01 22:06:26,751 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2019-01-01 22:06:27,070 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-01 22:06:27,292 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-01-01 22:06:29,376 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 272 DAG size of output: 239 [2019-01-01 22:06:29,968 WARN L181 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-01-01 22:06:30,261 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-01-01 22:06:30,848 WARN L181 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-01 22:06:31,341 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-01-01 22:06:33,142 WARN L181 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 192 DAG size of output: 182 [2019-01-01 22:06:33,939 WARN L181 SmtUtils]: Spent 793.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-01 22:06:33,942 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:33,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:33,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:33,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:33,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:33,942 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:33,942 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:33,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:33,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration17_Lasso [2019-01-01 22:06:33,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:33,942 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:33,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:33,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:33,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:33,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:34,539 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) [2019-01-01 22:06:34,552 INFO L168 Benchmark]: Toolchain (without parser) took 56401.09 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 950.0 MB in the beginning and 1.5 GB in the end (delta: -558.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-01 22:06:34,553 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:34,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.18 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:34,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.24 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:34,561 INFO L168 Benchmark]: Boogie Preprocessor took 103.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:34,565 INFO L168 Benchmark]: RCFGBuilder took 618.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:34,565 INFO L168 Benchmark]: BuchiAutomizer took 55343.87 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 896.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -424.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-01 22:06:34,577 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.18 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.24 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 618.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 55343.87 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 896.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -424.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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...