./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 91b1670e 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-91b1670 [2018-11-28 23:24:06,421 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:24:06,423 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:24:06,435 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:24:06,435 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:24:06,436 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:24:06,438 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:24:06,440 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:24:06,442 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:24:06,442 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:24:06,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:24:06,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:24:06,445 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:24:06,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:24:06,447 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:24:06,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:24:06,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:24:06,450 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:24:06,453 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:24:06,454 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:24:06,456 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:24:06,457 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:24:06,459 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:24:06,460 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:24:06,460 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:24:06,461 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:24:06,462 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:24:06,463 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:24:06,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:24:06,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:24:06,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:24:06,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:24:06,466 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:24:06,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:24:06,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:24:06,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:24:06,469 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:24:06,485 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:24:06,486 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:24:06,487 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:24:06,487 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:24:06,487 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:24:06,488 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:24:06,488 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:24:06,488 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:24:06,488 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:24:06,488 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:24:06,489 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:24:06,489 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:24:06,489 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:24:06,489 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:24:06,489 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:24:06,489 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:24:06,490 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:24:06,490 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:24:06,490 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:24:06,490 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:24:06,490 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:24:06,490 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:24:06,491 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:24:06,491 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:24:06,491 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:24:06,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:24:06,491 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:24:06,492 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:24:06,492 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:24:06,493 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 [2018-11-28 23:24:06,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:24:06,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:24:06,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:24:06,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:24:06,568 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:24:06,570 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-11-28 23:24:06,627 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e7bab8f/3e6db886782a47ed8f29fdd28e2ee3a4/FLAG8f8c37108 [2018-11-28 23:24:07,063 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:24:07,063 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/mergeSort_true-termination.c.i [2018-11-28 23:24:07,070 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e7bab8f/3e6db886782a47ed8f29fdd28e2ee3a4/FLAG8f8c37108 [2018-11-28 23:24:07,400 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e7bab8f/3e6db886782a47ed8f29fdd28e2ee3a4 [2018-11-28 23:24:07,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:24:07,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:24:07,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:07,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:24:07,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:24:07,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2eb997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07, skipping insertion in model container [2018-11-28 23:24:07,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:24:07,445 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:24:07,645 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:07,658 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:24:07,685 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:07,703 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:24:07,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07 WrapperNode [2018-11-28 23:24:07,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:07,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:07,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:24:07,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:24:07,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:07,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:24:07,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:24:07,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:24:07,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (1/1) ... [2018-11-28 23:24:07,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:24:07,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:24:07,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:24:07,860 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:24:07,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (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 [2018-11-28 23:24:07,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:24:07,929 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2018-11-28 23:24:07,930 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2018-11-28 23:24:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:24:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:24:07,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:24:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:24:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:24:08,469 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:24:08,470 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 23:24:08,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:08 BoogieIcfgContainer [2018-11-28 23:24:08,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:24:08,471 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:24:08,471 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:24:08,475 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:24:08,476 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:08,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:24:07" (1/3) ... [2018-11-28 23:24:08,477 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@276144bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:08, skipping insertion in model container [2018-11-28 23:24:08,477 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:08,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:07" (2/3) ... [2018-11-28 23:24:08,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@276144bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:08, skipping insertion in model container [2018-11-28 23:24:08,478 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:08,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:08" (3/3) ... [2018-11-28 23:24:08,480 INFO L375 chiAutomizerObserver]: Analyzing ICFG mergeSort_true-termination.c.i [2018-11-28 23:24:08,541 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:24:08,542 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:24:08,542 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:24:08,543 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:24:08,543 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:24:08,543 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:24:08,544 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:24:08,544 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:24:08,544 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:24:08,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-28 23:24:08,586 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-28 23:24:08,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:08,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:08,593 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:24:08,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:08,594 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:24:08,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-28 23:24:08,597 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-28 23:24:08,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:08,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:08,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:24:08,598 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:08,607 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 30#L35true assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4#L40-3true [2018-11-28 23:24:08,607 INFO L796 eck$LassoCheckResult]: Loop: 4#L40-3true assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 5#L40-2true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4#L40-3true [2018-11-28 23:24:08,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:08,613 INFO L82 PathProgramCache]: Analyzing trace with hash 88447, now seen corresponding path program 1 times [2018-11-28 23:24:08,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:08,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:08,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:08,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2018-11-28 23:24:08,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:08,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:08,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:08,760 INFO L82 PathProgramCache]: Analyzing trace with hash 84999937, now seen corresponding path program 1 times [2018-11-28 23:24:08,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:08,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:08,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:08,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:09,059 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 23:24:09,299 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 23:24:09,315 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:09,316 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:09,316 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:09,317 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:09,317 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:09,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:09,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:09,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:09,317 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:24:09,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:09,318 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:09,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:09,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:09,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:09,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:09,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:09,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:09,590 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-28 23:24:09,711 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 23:24:10,262 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 23:24:10,401 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:10,406 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:10,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:10,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:10,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:10,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:10,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:10,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:10,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:10,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:10,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:10,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:10,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:10,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:10,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:10,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:10,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:10,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:10,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:10,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:10,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:10,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:10,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:10,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:10,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:10,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:10,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:10,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:10,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:10,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:10,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:10,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:10,569 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:10,622 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:24:10,623 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 23:24:10,625 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:10,631 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:10,631 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:10,633 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1, ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1 - 4*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2018-11-28 23:24:10,667 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:10,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:24:10,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:10,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:10,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:10,902 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:24:10,903 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 3 states. [2018-11-28 23:24:11,013 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 3 states. Result 59 states and 83 transitions. Complement of second has 9 states. [2018-11-28 23:24:11,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:24:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-28 23:24:11,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:24:11,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:11,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:24:11,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:11,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 23:24:11,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:11,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2018-11-28 23:24:11,042 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 23:24:11,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 26 states and 37 transitions. [2018-11-28 23:24:11,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 23:24:11,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 23:24:11,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2018-11-28 23:24:11,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:11,066 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-28 23:24:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2018-11-28 23:24:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 23:24:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:24:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-11-28 23:24:11,099 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-28 23:24:11,100 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-28 23:24:11,100 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:24:11,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2018-11-28 23:24:11,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 23:24:11,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:11,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:11,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:24:11,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:11,103 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 165#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 155#L40-3 assume !(main_~i~1 < main_~n~0); 151#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 169#merge_sortENTRY [2018-11-28 23:24:11,103 INFO L796 eck$LassoCheckResult]: Loop: 169#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 158#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 152#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 169#merge_sortENTRY [2018-11-28 23:24:11,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash 84999888, now seen corresponding path program 1 times [2018-11-28 23:24:11,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:11,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:11,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:11,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:11,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:24:11,212 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:11,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2018-11-28 23:24:11,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:11,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:11,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:11,414 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:24:11,696 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2018-11-28 23:24:11,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:24:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:24:11,703 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-28 23:24:11,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:11,730 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2018-11-28 23:24:11,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:24:11,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-11-28 23:24:11,734 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 23:24:11,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2018-11-28 23:24:11,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 23:24:11,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 23:24:11,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-28 23:24:11,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:11,739 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 23:24:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-28 23:24:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 23:24:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:24:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-11-28 23:24:11,744 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-28 23:24:11,744 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-28 23:24:11,745 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:24:11,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2018-11-28 23:24:11,746 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 23:24:11,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:11,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:11,746 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:11,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:11,747 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 223#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 224#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 214#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 215#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 216#L40-3 assume !(main_~i~1 < main_~n~0); 211#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 228#merge_sortENTRY [2018-11-28 23:24:11,747 INFO L796 eck$LassoCheckResult]: Loop: 228#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 217#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 209#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 228#merge_sortENTRY [2018-11-28 23:24:11,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash 80563154, now seen corresponding path program 1 times [2018-11-28 23:24:11,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:11,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:11,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:11,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:11,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 2 times [2018-11-28 23:24:11,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:11,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:11,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:11,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:11,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash -829797441, now seen corresponding path program 1 times [2018-11-28 23:24:11,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:11,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:11,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:11,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:11,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:11,924 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 [2018-11-28 23:24:11,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:11,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:12,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:12,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 23:24:12,318 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 23:24:12,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:24:12,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:24:12,406 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-28 23:24:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:12,497 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-28 23:24:12,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:24:12,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2018-11-28 23:24:12,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 23:24:12,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2018-11-28 23:24:12,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:24:12,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:24:12,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-11-28 23:24:12,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:12,505 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-28 23:24:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-11-28 23:24:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-28 23:24:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:24:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-28 23:24:12,509 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-28 23:24:12,509 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-28 23:24:12,509 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:24:12,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-28 23:24:12,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 23:24:12,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:12,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:12,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:24:12,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:12,512 INFO L794 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 330#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 331#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 320#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 321#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 322#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 323#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 341#L40-3 assume !(main_~i~1 < main_~n~0); 316#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 335#merge_sortENTRY [2018-11-28 23:24:12,512 INFO L796 eck$LassoCheckResult]: Loop: 335#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 324#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 315#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 335#merge_sortENTRY [2018-11-28 23:24:12,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash 111829076, now seen corresponding path program 2 times [2018-11-28 23:24:12,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:12,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:12,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 3 times [2018-11-28 23:24:12,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:12,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:12,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:12,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:12,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:12,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1394618371, now seen corresponding path program 2 times [2018-11-28 23:24:12,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:12,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:12,739 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:24:13,329 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-28 23:24:13,520 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:13,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:13,521 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:13,521 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:13,521 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:13,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:13,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:13,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:13,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:24:13,522 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:13,522 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:13,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:13,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:14,285 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:14,285 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:14,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:14,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:14,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:14,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:14,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,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 [2018-11-28 23:24:14,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:14,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:14,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:14,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,566 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:14,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,567 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:14,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:14,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:14,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:14,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:14,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:14,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:14,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:14,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:14,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:14,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:14,613 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:14,614 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:24:14,614 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:14,616 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:14,617 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:14,617 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2018-11-28 23:24:14,644 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:24:14,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:14,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:14,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:14,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:24:14,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-28 23:24:15,126 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 12 states. [2018-11-28 23:24:15,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:24:15,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:24:15,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:15,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 23:24:15,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:15,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 23:24:15,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:15,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-11-28 23:24:15,131 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 23:24:15,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 49 transitions. [2018-11-28 23:24:15,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 23:24:15,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:24:15,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2018-11-28 23:24:15,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:15,137 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-11-28 23:24:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2018-11-28 23:24:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-28 23:24:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 23:24:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-11-28 23:24:15,143 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-28 23:24:15,143 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-28 23:24:15,143 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:24:15,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2018-11-28 23:24:15,144 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 23:24:15,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:15,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:15,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:15,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:15,153 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.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 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 [2018-11-28 23:24:15,154 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 [2018-11-28 23:24:15,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744228, now seen corresponding path program 1 times [2018-11-28 23:24:15,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:15,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:15,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:15,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 1 times [2018-11-28 23:24:15,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:15,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:15,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1064649429, now seen corresponding path program 1 times [2018-11-28 23:24:15,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:15,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:15,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:24:15,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:15,505 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 [2018-11-28 23:24:15,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:15,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:15,762 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-11-28 23:24:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:15,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:15,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-28 23:24:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:24:16,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:24:16,352 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 13 states. [2018-11-28 23:24:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:16,549 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-28 23:24:16,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:24:16,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2018-11-28 23:24:16,558 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-11-28 23:24:16,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 65 states and 81 transitions. [2018-11-28 23:24:16,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-28 23:24:16,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-28 23:24:16,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2018-11-28 23:24:16,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:16,561 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2018-11-28 23:24:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2018-11-28 23:24:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-28 23:24:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 23:24:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2018-11-28 23:24:16,569 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-11-28 23:24:16,569 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-11-28 23:24:16,569 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:24:16,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2018-11-28 23:24:16,571 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-11-28 23:24:16,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:16,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:16,572 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:16,572 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:16,572 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.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 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 [2018-11-28 23:24:16,572 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 [2018-11-28 23:24:16,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:16,572 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 2 times [2018-11-28 23:24:16,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:16,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:16,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:16,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:16,624 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 2 times [2018-11-28 23:24:16,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:16,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:16,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:16,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash -889748845, now seen corresponding path program 2 times [2018-11-28 23:24:16,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:16,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:17,411 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2018-11-28 23:24:17,672 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-11-28 23:24:18,049 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-28 23:24:18,104 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:18,104 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:18,104 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:18,104 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:18,104 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:18,104 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:18,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:18,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:18,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration6_Lasso [2018-11-28 23:24:18,105 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:18,105 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:18,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,911 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:18,911 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:18,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 [2018-11-28 23:24:18,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,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 [2018-11-28 23:24:18,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,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 [2018-11-28 23:24:18,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:18,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:18,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:18,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:18,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:18,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:18,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:18,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:18,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:18,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:18,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:18,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,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 [2018-11-28 23:24:19,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,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 [2018-11-28 23:24:19,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,110 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:19,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,111 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:19,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,161 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:19,227 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:24:19,227 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 23:24:19,227 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:19,230 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:19,230 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:19,230 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~n, merge_sort_~m~0) = 1*merge_sort_~n - 1*merge_sort_~m~0 Supporting invariants [] [2018-11-28 23:24:19,231 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:24:19,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:19,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:19,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:19,648 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 23:24:19,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-11-28 23:24:19,845 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. [2018-11-28 23:24:19,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:24:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2018-11-28 23:24:19,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 8 letters. [2018-11-28 23:24:19,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:19,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 26 letters. Loop has 8 letters. [2018-11-28 23:24:19,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:19,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 68 transitions. Stem has 18 letters. Loop has 16 letters. [2018-11-28 23:24:19,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:19,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 425 transitions. [2018-11-28 23:24:19,870 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2018-11-28 23:24:19,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 227 states and 317 transitions. [2018-11-28 23:24:19,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2018-11-28 23:24:19,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2018-11-28 23:24:19,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 317 transitions. [2018-11-28 23:24:19,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:19,883 INFO L705 BuchiCegarLoop]: Abstraction has 227 states and 317 transitions. [2018-11-28 23:24:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 317 transitions. [2018-11-28 23:24:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 206. [2018-11-28 23:24:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-28 23:24:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 282 transitions. [2018-11-28 23:24:19,909 INFO L728 BuchiCegarLoop]: Abstraction has 206 states and 282 transitions. [2018-11-28 23:24:19,910 INFO L608 BuchiCegarLoop]: Abstraction has 206 states and 282 transitions. [2018-11-28 23:24:19,911 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:24:19,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 282 transitions. [2018-11-28 23:24:19,915 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2018-11-28 23:24:19,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:19,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:19,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:19,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:24:19,918 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.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 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.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1206#L11-3 [2018-11-28 23:24:19,918 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~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 1214#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1206#L11-3 [2018-11-28 23:24:19,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 1 times [2018-11-28 23:24:19,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:19,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:19,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:19,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:19,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:19,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2018-11-28 23:24:19,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:19,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:19,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:19,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:19,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:19,962 INFO L82 PathProgramCache]: Analyzing trace with hash -782974256, now seen corresponding path program 1 times [2018-11-28 23:24:19,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:19,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:19,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:20,218 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-28 23:24:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:24:20,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:20,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:24:20,679 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:24:20,805 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 23:24:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:24:20,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:24:20,806 INFO L87 Difference]: Start difference. First operand 206 states and 282 transitions. cyclomatic complexity: 100 Second operand 4 states. [2018-11-28 23:24:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:20,875 INFO L93 Difference]: Finished difference Result 319 states and 436 transitions. [2018-11-28 23:24:20,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:24:20,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 436 transitions. [2018-11-28 23:24:20,886 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 134 [2018-11-28 23:24:20,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 319 states and 436 transitions. [2018-11-28 23:24:20,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2018-11-28 23:24:20,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2018-11-28 23:24:20,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 436 transitions. [2018-11-28 23:24:20,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:20,905 INFO L705 BuchiCegarLoop]: Abstraction has 319 states and 436 transitions. [2018-11-28 23:24:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 436 transitions. [2018-11-28 23:24:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 260. [2018-11-28 23:24:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 23:24:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 345 transitions. [2018-11-28 23:24:20,930 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 345 transitions. [2018-11-28 23:24:20,930 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 345 transitions. [2018-11-28 23:24:20,930 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:24:20,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 345 transitions. [2018-11-28 23:24:20,932 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2018-11-28 23:24:20,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:20,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:20,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:20,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:20,941 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.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 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.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1750#L11-3 [2018-11-28 23:24:20,941 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~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 1762#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1750#L11-3 [2018-11-28 23:24:20,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:20,941 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 2 times [2018-11-28 23:24:20,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:20,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:20,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:20,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2018-11-28 23:24:20,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:20,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:20,987 INFO L82 PathProgramCache]: Analyzing trace with hash 389830265, now seen corresponding path program 1 times [2018-11-28 23:24:20,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:20,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:20,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:20,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:21,259 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-11-28 23:24:21,761 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 115 [2018-11-28 23:24:22,085 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-28 23:24:22,227 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-28 23:24:22,742 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2018-11-28 23:24:22,863 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-28 23:24:22,868 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:22,868 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:22,868 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:22,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:22,868 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:22,868 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:22,868 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:22,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:22,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration8_Lasso [2018-11-28 23:24:22,869 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:22,869 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:22,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,269 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2018-11-28 23:24:23,443 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-11-28 23:24:23,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:23,903 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-28 23:24:24,311 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-11-28 23:24:24,569 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-28 23:24:24,717 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:24,718 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:24,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:24,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:24,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:24,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:24,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:24,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:24,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:24,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:24,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:24,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:24,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:24,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:24,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:24,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,729 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:24,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,730 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:24,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:24,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:24,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:24,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:24,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:24,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:24,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:24,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:24,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:24,749 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 23:24:24,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:24,799 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-28 23:24:24,800 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-28 23:24:27,171 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:27,797 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:24:27,797 INFO L444 ModelExtractionUtils]: 184 out of 208 variables were initially zero. Simplification set additionally 20 variables to zero. [2018-11-28 23:24:27,798 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:27,802 INFO L440 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2018-11-28 23:24:27,803 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:27,803 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~x~0.offset, merge_sort_merge_~k~0, v_rep(select #length merge_sort_merge_~x~0.base)_1) = -1*merge_sort_merge_~x~0.offset - 4*merge_sort_merge_~k~0 + 1*v_rep(select #length merge_sort_merge_~x~0.base)_1 Supporting invariants [] [2018-11-28 23:24:27,939 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:24:27,941 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:24:27,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:27,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:28,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:28,056 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:24:28,056 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 345 transitions. cyclomatic complexity: 109 Second operand 5 states. [2018-11-28 23:24:28,199 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 345 transitions. cyclomatic complexity: 109. Second operand 5 states. Result 567 states and 781 transitions. Complement of second has 14 states. [2018-11-28 23:24:28,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-28 23:24:28,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 22 letters. Loop has 8 letters. [2018-11-28 23:24:28,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:28,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 30 letters. Loop has 8 letters. [2018-11-28 23:24:28,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:28,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 22 letters. Loop has 16 letters. [2018-11-28 23:24:28,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:28,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 781 transitions. [2018-11-28 23:24:28,225 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 104 [2018-11-28 23:24:28,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 426 states and 588 transitions. [2018-11-28 23:24:28,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2018-11-28 23:24:28,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2018-11-28 23:24:28,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 426 states and 588 transitions. [2018-11-28 23:24:28,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:28,245 INFO L705 BuchiCegarLoop]: Abstraction has 426 states and 588 transitions. [2018-11-28 23:24:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states and 588 transitions. [2018-11-28 23:24:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 420. [2018-11-28 23:24:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-11-28 23:24:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2018-11-28 23:24:28,299 INFO L728 BuchiCegarLoop]: Abstraction has 420 states and 580 transitions. [2018-11-28 23:24:28,299 INFO L608 BuchiCegarLoop]: Abstraction has 420 states and 580 transitions. [2018-11-28 23:24:28,299 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:24:28,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 420 states and 580 transitions. [2018-11-28 23:24:28,307 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 102 [2018-11-28 23:24:28,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:28,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:28,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:28,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:28,308 INFO L794 eck$LassoCheckResult]: Stem: 2775#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2742#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; 2743#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 2709#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; 2710#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2711#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; 2712#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2713#L40-3 assume !(main_~i~1 < main_~n~0); 2700#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 2755#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2903#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 2900#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 2901#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2904#L24 assume ~n < 2; 2902#L8 assume true; 2899#merge_sortEXIT >#86#return; 2895#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 2896#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2898#L24 assume ~n < 2; 2897#L8 assume true; 2894#merge_sortEXIT >#88#return; 2890#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 2885#L11-3 assume !(merge_~k~0 < merge_~n); 2874#L11-4 merge_~i~0 := 0; 2699#L17-3 [2018-11-28 23:24:28,309 INFO L796 eck$LassoCheckResult]: Loop: 2699#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; 2702#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 2699#L17-3 [2018-11-28 23:24:28,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1013709224, now seen corresponding path program 1 times [2018-11-28 23:24:28,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:28,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:24:28,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:28,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:24:28,455 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:28,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2018-11-28 23:24:28,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:28,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:24:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:24:28,532 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. cyclomatic complexity: 198 Second operand 4 states. [2018-11-28 23:24:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:28,596 INFO L93 Difference]: Finished difference Result 602 states and 792 transitions. [2018-11-28 23:24:28,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:24:28,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 602 states and 792 transitions. [2018-11-28 23:24:28,608 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 102 [2018-11-28 23:24:28,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 602 states to 602 states and 792 transitions. [2018-11-28 23:24:28,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2018-11-28 23:24:28,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 274 [2018-11-28 23:24:28,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 602 states and 792 transitions. [2018-11-28 23:24:28,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:28,629 INFO L705 BuchiCegarLoop]: Abstraction has 602 states and 792 transitions. [2018-11-28 23:24:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states and 792 transitions. [2018-11-28 23:24:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 437. [2018-11-28 23:24:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-11-28 23:24:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 597 transitions. [2018-11-28 23:24:28,661 INFO L728 BuchiCegarLoop]: Abstraction has 437 states and 597 transitions. [2018-11-28 23:24:28,661 INFO L608 BuchiCegarLoop]: Abstraction has 437 states and 597 transitions. [2018-11-28 23:24:28,662 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:24:28,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 437 states and 597 transitions. [2018-11-28 23:24:28,667 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 102 [2018-11-28 23:24:28,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:28,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:28,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:28,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:28,671 INFO L794 eck$LassoCheckResult]: Stem: 3801#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3774#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; 3775#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 3739#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; 3740#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3741#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; 3742#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3861#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; 3743#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3744#L40-3 assume !(main_~i~1 < main_~n~0); 3732#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 3860#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3749#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3750#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 3819#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3842#L24 assume ~n < 2; 3841#L8 assume true; 3840#merge_sortEXIT >#86#return; 3770#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 3837#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3838#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3735#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4012#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4010#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3871#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4007#merge_sortENTRY [2018-11-28 23:24:28,671 INFO L796 eck$LassoCheckResult]: Loop: 4007#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4009#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3868#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4007#merge_sortENTRY [2018-11-28 23:24:28,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1495319133, now seen corresponding path program 3 times [2018-11-28 23:24:28,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 23:24:29,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:29,516 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 [2018-11-28 23:24:29,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:24:29,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:24:29,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:24:29,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:29,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:29,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2018-11-28 23:24:29,807 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:29,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 4 times [2018-11-28 23:24:29,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:29,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:29,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:29,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:30,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 23:24:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-11-28 23:24:30,012 INFO L87 Difference]: Start difference. First operand 437 states and 597 transitions. cyclomatic complexity: 198 Second operand 18 states. [2018-11-28 23:24:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:30,720 INFO L93 Difference]: Finished difference Result 274 states and 358 transitions. [2018-11-28 23:24:30,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 23:24:30,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 358 transitions. [2018-11-28 23:24:30,727 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 92 [2018-11-28 23:24:30,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 266 states and 350 transitions. [2018-11-28 23:24:30,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2018-11-28 23:24:30,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2018-11-28 23:24:30,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 350 transitions. [2018-11-28 23:24:30,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:30,735 INFO L705 BuchiCegarLoop]: Abstraction has 266 states and 350 transitions. [2018-11-28 23:24:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 350 transitions. [2018-11-28 23:24:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 178. [2018-11-28 23:24:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-28 23:24:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 227 transitions. [2018-11-28 23:24:30,746 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 227 transitions. [2018-11-28 23:24:30,746 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 227 transitions. [2018-11-28 23:24:30,746 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:24:30,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 227 transitions. [2018-11-28 23:24:30,751 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 42 [2018-11-28 23:24:30,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:30,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:30,752 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] [2018-11-28 23:24:30,752 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:30,752 INFO L794 eck$LassoCheckResult]: Stem: 4612#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4592#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; 4593#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4566#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; 4567#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4568#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; 4569#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4627#L40-3 assume !(main_~i~1 < main_~n~0); 4562#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 4602#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4727#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4641#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4664#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4665#L24 assume ~n < 2; 4640#L8 assume true; 4642#merge_sortEXIT >#86#return; 4573#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 4618#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4572#L24 assume ~n < 2; 4574#L8 assume true; 4734#merge_sortEXIT >#88#return; 4681#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 4730#L11-3 assume !!(merge_~k~0 < merge_~n); 4608#L12 assume !(merge_~j~0 == merge_~n); 4583#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; 4584#L13-2 merge_#t~ite15 := merge_#t~ite14; 4591#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 4610#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 4614#L11-3 assume !(merge_~k~0 < merge_~n); 4617#L11-4 merge_~i~0 := 0; 4561#L17-3 [2018-11-28 23:24:30,752 INFO L796 eck$LassoCheckResult]: Loop: 4561#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; 4564#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 4561#L17-3 [2018-11-28 23:24:30,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash 336388346, now seen corresponding path program 1 times [2018-11-28 23:24:30,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:30,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:30,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:30,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:30,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:24:30,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:30,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:24:30,890 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:30,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2018-11-28 23:24:30,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:30,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:24:30,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:24:30,960 INFO L87 Difference]: Start difference. First operand 178 states and 227 transitions. cyclomatic complexity: 62 Second operand 4 states. [2018-11-28 23:24:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:31,035 INFO L93 Difference]: Finished difference Result 218 states and 277 transitions. [2018-11-28 23:24:31,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:24:31,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 277 transitions. [2018-11-28 23:24:31,044 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-11-28 23:24:31,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 218 states and 277 transitions. [2018-11-28 23:24:31,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2018-11-28 23:24:31,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2018-11-28 23:24:31,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 218 states and 277 transitions. [2018-11-28 23:24:31,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:31,049 INFO L705 BuchiCegarLoop]: Abstraction has 218 states and 277 transitions. [2018-11-28 23:24:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states and 277 transitions. [2018-11-28 23:24:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2018-11-28 23:24:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-28 23:24:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 272 transitions. [2018-11-28 23:24:31,061 INFO L728 BuchiCegarLoop]: Abstraction has 213 states and 272 transitions. [2018-11-28 23:24:31,061 INFO L608 BuchiCegarLoop]: Abstraction has 213 states and 272 transitions. [2018-11-28 23:24:31,062 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:24:31,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 272 transitions. [2018-11-28 23:24:31,067 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-11-28 23:24:31,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:31,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:31,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:31,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:31,071 INFO L794 eck$LassoCheckResult]: Stem: 5019#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4997#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; 4998#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4971#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; 4972#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4973#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; 4974#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4975#L40-3 assume !(main_~i~1 < main_~n~0); 4967#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 5081#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5079#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 5073#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 5076#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5094#L24 assume ~n < 2; 5092#L8 assume true; 5072#merge_sortEXIT >#86#return; 5070#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 5071#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5095#L24 assume ~n < 2; 5082#L8 assume true; 5083#merge_sortEXIT >#88#return; 5067#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 5065#L11-3 assume !!(merge_~k~0 < merge_~n); 5066#L12 assume !(merge_~j~0 == merge_~n); 5064#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); 5062#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; 5063#L14-2 merge_#t~ite14 := merge_#t~ite13; 5056#L13-2 merge_#t~ite15 := merge_#t~ite14; 5052#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 5050#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 5051#L11-3 assume !(merge_~k~0 < merge_~n); 5023#L11-4 merge_~i~0 := 0; 4966#L17-3 [2018-11-28 23:24:31,071 INFO L796 eck$LassoCheckResult]: Loop: 4966#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; 4970#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 4966#L17-3 [2018-11-28 23:24:31,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash -810277004, now seen corresponding path program 1 times [2018-11-28 23:24:31,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:31,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:24:31,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:31,309 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 [2018-11-28 23:24:31,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:31,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 23:24:31,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:31,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 23:24:31,428 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:31,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:31,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2018-11-28 23:24:31,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:31,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:31,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:31,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:24:31,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:24:31,488 INFO L87 Difference]: Start difference. First operand 213 states and 272 transitions. cyclomatic complexity: 72 Second operand 7 states. [2018-11-28 23:24:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:31,583 INFO L93 Difference]: Finished difference Result 353 states and 432 transitions. [2018-11-28 23:24:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:24:31,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 432 transitions. [2018-11-28 23:24:31,592 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-11-28 23:24:31,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 353 states and 432 transitions. [2018-11-28 23:24:31,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2018-11-28 23:24:31,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2018-11-28 23:24:31,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 432 transitions. [2018-11-28 23:24:31,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:31,598 INFO L705 BuchiCegarLoop]: Abstraction has 353 states and 432 transitions. [2018-11-28 23:24:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 432 transitions. [2018-11-28 23:24:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 273. [2018-11-28 23:24:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-28 23:24:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 337 transitions. [2018-11-28 23:24:31,614 INFO L728 BuchiCegarLoop]: Abstraction has 273 states and 337 transitions. [2018-11-28 23:24:31,614 INFO L608 BuchiCegarLoop]: Abstraction has 273 states and 337 transitions. [2018-11-28 23:24:31,614 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 23:24:31,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states and 337 transitions. [2018-11-28 23:24:31,619 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 54 [2018-11-28 23:24:31,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:31,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:31,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:31,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:31,621 INFO L794 eck$LassoCheckResult]: Stem: 5702#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5672#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; 5673#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 5646#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; 5647#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5648#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; 5649#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5650#L40-3 assume !(main_~i~1 < main_~n~0); 5642#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 5679#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5846#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 5739#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 5845#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5847#L24 assume ~n < 2; 5738#L8 assume true; 5740#merge_sortEXIT >#86#return; 5652#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 5714#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5651#L24 assume ~n < 2; 5653#L8 assume true; 5782#merge_sortEXIT >#88#return; 5735#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 5704#L11-3 assume !!(merge_~k~0 < merge_~n); 5705#L12 assume !(merge_~j~0 == merge_~n); 5869#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); 5870#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; 5889#L14-2 merge_#t~ite14 := merge_#t~ite13; 5888#L13-2 merge_#t~ite15 := merge_#t~ite14; 5887#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 5886#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 5884#L11-3 assume !!(merge_~k~0 < merge_~n); 5881#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; 5882#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 5726#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 5727#L11-3 assume !(merge_~k~0 < merge_~n); 5723#L11-4 merge_~i~0 := 0; 5641#L17-3 [2018-11-28 23:24:31,621 INFO L796 eck$LassoCheckResult]: Loop: 5641#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; 5645#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 5641#L17-3 [2018-11-28 23:24:31,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash 64206937, now seen corresponding path program 1 times [2018-11-28 23:24:31,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:31,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:31,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:31,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2018-11-28 23:24:31,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:31,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:31,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:31,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:31,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1573325915, now seen corresponding path program 1 times [2018-11-28 23:24:31,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:31,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:31,981 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:24:32,109 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:24:33,252 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 220 DAG size of output: 194 [2018-11-28 23:24:33,802 WARN L180 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-11-28 23:24:33,969 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-28 23:24:34,142 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-28 23:24:34,759 WARN L180 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2018-11-28 23:24:34,940 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-28 23:24:34,943 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:34,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:34,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:34,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:34,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:34,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:34,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:34,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:34,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration13_Lasso [2018-11-28 23:24:34,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:34,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:34,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:34,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,586 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2018-11-28 23:24:35,743 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-11-28 23:24:35,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:35,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:36,361 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-11-28 23:24:36,762 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 23:24:36,957 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:36,962 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:36,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:36,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:36,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:36,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:36,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:36,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:36,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:36,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:36,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:36,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:36,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:36,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:36,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:36,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:36,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:36,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:36,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:36,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:36,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:36,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:36,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:36,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:36,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:36,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:36,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:36,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:36,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:36,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:36,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:36,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:36,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:36,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:36,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:36,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:36,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:36,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:36,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:36,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:36,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:36,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:36,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:36,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:36,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:36,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:36,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:36,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:36,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:36,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:36,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:36,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:36,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:36,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:36,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:36,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:36,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:36,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:36,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:36,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:36,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:36,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:36,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:36,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:36,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:36,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:36,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:36,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:36,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:36,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:36,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:36,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,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 [2018-11-28 23:24:37,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,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 [2018-11-28 23:24:37,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,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 [2018-11-28 23:24:37,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:37,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:37,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:37,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,078 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:37,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,079 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:37,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,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 [2018-11-28 23:24:37,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:37,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:37,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:37,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:37,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:37,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:37,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:37,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:37,195 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:37,243 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:24:37,243 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:24:37,243 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:37,244 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:37,244 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:37,244 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, v_rep(select #length merge_sort_merge_~a.base)_2, merge_sort_merge_~i~0) = -1*merge_sort_merge_~a.offset + 1*v_rep(select #length merge_sort_merge_~a.base)_2 - 4*merge_sort_merge_~i~0 Supporting invariants [] [2018-11-28 23:24:37,603 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-11-28 23:24:37,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:24:37,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:37,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:24:37,711 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 273 states and 337 transitions. cyclomatic complexity: 77 Second operand 4 states. [2018-11-28 23:24:37,785 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 273 states and 337 transitions. cyclomatic complexity: 77. Second operand 4 states. Result 285 states and 356 transitions. Complement of second has 12 states. [2018-11-28 23:24:37,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-28 23:24:37,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 2 letters. [2018-11-28 23:24:37,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:37,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 38 letters. Loop has 2 letters. [2018-11-28 23:24:37,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:37,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 36 letters. Loop has 4 letters. [2018-11-28 23:24:37,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:37,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 356 transitions. [2018-11-28 23:24:37,824 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2018-11-28 23:24:37,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 224 states and 279 transitions. [2018-11-28 23:24:37,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2018-11-28 23:24:37,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2018-11-28 23:24:37,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 279 transitions. [2018-11-28 23:24:37,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:37,828 INFO L705 BuchiCegarLoop]: Abstraction has 224 states and 279 transitions. [2018-11-28 23:24:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 279 transitions. [2018-11-28 23:24:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-11-28 23:24:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-28 23:24:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 279 transitions. [2018-11-28 23:24:37,837 INFO L728 BuchiCegarLoop]: Abstraction has 224 states and 279 transitions. [2018-11-28 23:24:37,837 INFO L608 BuchiCegarLoop]: Abstraction has 224 states and 279 transitions. [2018-11-28 23:24:37,837 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 23:24:37,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 279 transitions. [2018-11-28 23:24:37,840 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2018-11-28 23:24:37,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:37,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:37,841 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:37,841 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:37,842 INFO L794 eck$LassoCheckResult]: Stem: 6476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6441#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; 6442#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 6422#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; 6423#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6424#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; 6425#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6500#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; 6499#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6495#L40-3 assume !(main_~i~1 < main_~n~0); 6448#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 6453#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6523#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6524#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6552#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6485#L24 assume ~n < 2; 6553#L8 assume true; 6551#merge_sortEXIT >#86#return; 6419#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6507#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6508#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6470#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6522#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6525#L24 assume ~n < 2; 6521#L8 assume true; 6469#merge_sortEXIT >#86#return; 6471#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6482#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6483#L24 assume ~n < 2; 6569#L8 assume true; 6568#merge_sortEXIT >#88#return; 6567#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 6566#L11-3 assume !!(merge_~k~0 < merge_~n); 6565#L12 assume !(merge_~j~0 == merge_~n); 6564#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); 6560#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; 6558#L14-2 merge_#t~ite14 := merge_#t~ite13; 6556#L13-2 merge_#t~ite15 := merge_#t~ite14; 6554#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 6549#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6548#L11-3 assume !!(merge_~k~0 < merge_~n); 6539#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; 6540#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 6600#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6546#L11-3 assume !(merge_~k~0 < merge_~n); 6497#L11-4 merge_~i~0 := 0; 6489#L17-3 assume !(merge_~i~0 < merge_~n); 6420#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 6591#L8 assume true; 6589#merge_sortEXIT >#88#return; 6513#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 6588#L11-3 assume !!(merge_~k~0 < merge_~n); 6587#L12 assume !(merge_~j~0 == merge_~n); 6586#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); 6583#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; 6580#L14-2 merge_#t~ite14 := merge_#t~ite13; 6578#L13-2 merge_#t~ite15 := merge_#t~ite14; 6576#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 6574#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6572#L11-3 assume !!(merge_~k~0 < merge_~n); 6571#L12 [2018-11-28 23:24:37,842 INFO L796 eck$LassoCheckResult]: Loop: 6571#L12 assume !(merge_~j~0 == merge_~n); 6585#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); 6581#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; 6582#L14-2 merge_#t~ite14 := merge_#t~ite13; 6596#L13-2 merge_#t~ite15 := merge_#t~ite14; 6536#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 6537#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 6570#L11-3 assume !!(merge_~k~0 < merge_~n); 6571#L12 [2018-11-28 23:24:37,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1719261906, now seen corresponding path program 1 times [2018-11-28 23:24:37,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:37,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:37,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-28 23:24:37,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:37,990 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 [2018-11-28 23:24:38,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:38,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 23:24:38,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:38,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-11-28 23:24:38,326 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:38,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:38,326 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2018-11-28 23:24:38,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:38,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:38,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:38,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:38,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:38,620 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-28 23:24:38,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 23:24:38,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-28 23:24:38,667 INFO L87 Difference]: Start difference. First operand 224 states and 279 transitions. cyclomatic complexity: 66 Second operand 20 states. [2018-11-28 23:24:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:40,036 INFO L93 Difference]: Finished difference Result 371 states and 460 transitions. [2018-11-28 23:24:40,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 23:24:40,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 371 states and 460 transitions. [2018-11-28 23:24:40,042 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 124 [2018-11-28 23:24:40,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 371 states to 365 states and 454 transitions. [2018-11-28 23:24:40,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 264 [2018-11-28 23:24:40,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2018-11-28 23:24:40,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 454 transitions. [2018-11-28 23:24:40,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:40,048 INFO L705 BuchiCegarLoop]: Abstraction has 365 states and 454 transitions. [2018-11-28 23:24:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 454 transitions. [2018-11-28 23:24:40,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 265. [2018-11-28 23:24:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-28 23:24:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 328 transitions. [2018-11-28 23:24:40,063 INFO L728 BuchiCegarLoop]: Abstraction has 265 states and 328 transitions. [2018-11-28 23:24:40,063 INFO L608 BuchiCegarLoop]: Abstraction has 265 states and 328 transitions. [2018-11-28 23:24:40,063 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 23:24:40,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 328 transitions. [2018-11-28 23:24:40,070 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2018-11-28 23:24:40,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:40,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:40,074 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:40,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:40,076 INFO L794 eck$LassoCheckResult]: Stem: 7306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7279#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; 7280#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 7258#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; 7259#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7322#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; 7323#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7260#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; 7261#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7262#L40-3 assume !(main_~i~1 < main_~n~0); 7251#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 7288#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7358#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 7351#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 7356#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7315#L24 assume ~n < 2; 7357#L8 assume true; 7350#merge_sortEXIT >#86#return; 7255#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 7345#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7325#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 7317#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 7318#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7365#L24 assume ~n < 2; 7362#L8 assume true; 7361#merge_sortEXIT >#86#return; 7264#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 7319#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7263#L24 assume ~n < 2; 7265#L8 assume true; 7422#merge_sortEXIT >#88#return; 7421#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 7420#L11-3 assume !!(merge_~k~0 < merge_~n); 7419#L12 assume !(merge_~j~0 == merge_~n); 7418#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); 7416#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; 7417#L14-2 merge_#t~ite14 := merge_#t~ite13; 7412#L13-2 merge_#t~ite15 := merge_#t~ite14; 7413#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 7304#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7305#L11-3 assume !!(merge_~k~0 < merge_~n); 7295#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; 7296#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 7382#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7370#L11-3 assume !(merge_~k~0 < merge_~n); 7327#L11-4 merge_~i~0 := 0; 7328#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; 7257#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 7253#L17-3 assume !(merge_~i~0 < merge_~n); 7256#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 7281#L8 assume true; 7282#merge_sortEXIT >#88#return; 7283#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 7284#L11-3 assume !!(merge_~k~0 < merge_~n); 7501#L12 assume !(merge_~j~0 == merge_~n); 7500#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); 7498#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; 7499#L14-2 merge_#t~ite14 := merge_#t~ite13; 7509#L13-2 merge_#t~ite15 := merge_#t~ite14; 7494#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 7493#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7308#L11-3 assume !!(merge_~k~0 < merge_~n); 7309#L12 [2018-11-28 23:24:40,076 INFO L796 eck$LassoCheckResult]: Loop: 7309#L12 assume !(merge_~j~0 == merge_~n); 7271#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); 7272#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; 7289#L14-2 merge_#t~ite14 := merge_#t~ite13; 7275#L13-2 merge_#t~ite15 := merge_#t~ite14; 7276#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 7298#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7303#L11-3 assume !!(merge_~k~0 < merge_~n); 7309#L12 [2018-11-28 23:24:40,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2004988308, now seen corresponding path program 1 times [2018-11-28 23:24:40,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:40,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:40,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:40,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:40,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-28 23:24:40,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:40,222 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 [2018-11-28 23:24:40,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:40,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 23:24:40,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:40,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-11-28 23:24:40,511 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:40,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2018-11-28 23:24:40,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:40,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:40,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:40,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:40,743 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-28 23:24:40,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 23:24:40,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:24:40,788 INFO L87 Difference]: Start difference. First operand 265 states and 328 transitions. cyclomatic complexity: 76 Second operand 21 states. [2018-11-28 23:24:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:42,660 INFO L93 Difference]: Finished difference Result 547 states and 692 transitions. [2018-11-28 23:24:42,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 23:24:42,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 547 states and 692 transitions. [2018-11-28 23:24:42,668 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 208 [2018-11-28 23:24:42,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 547 states to 547 states and 692 transitions. [2018-11-28 23:24:42,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2018-11-28 23:24:42,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 402 [2018-11-28 23:24:42,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 547 states and 692 transitions. [2018-11-28 23:24:42,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:42,674 INFO L705 BuchiCegarLoop]: Abstraction has 547 states and 692 transitions. [2018-11-28 23:24:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states and 692 transitions. [2018-11-28 23:24:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 273. [2018-11-28 23:24:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-28 23:24:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 336 transitions. [2018-11-28 23:24:42,683 INFO L728 BuchiCegarLoop]: Abstraction has 273 states and 336 transitions. [2018-11-28 23:24:42,683 INFO L608 BuchiCegarLoop]: Abstraction has 273 states and 336 transitions. [2018-11-28 23:24:42,683 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 23:24:42,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states and 336 transitions. [2018-11-28 23:24:42,685 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2018-11-28 23:24:42,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:42,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:42,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:42,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:42,686 INFO L794 eck$LassoCheckResult]: Stem: 8374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8351#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; 8352#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 8329#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; 8330#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8388#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; 8389#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8331#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; 8332#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8391#L40-3 assume !(main_~i~1 < main_~n~0); 8324#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 8358#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8424#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8386#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8387#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8384#L24 assume ~n < 2; 8443#L8 assume true; 8442#merge_sortEXIT >#86#return; 8342#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8417#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8436#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8420#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8421#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8435#L24 assume ~n < 2; 8434#L8 assume true; 8419#merge_sortEXIT >#86#return; 8381#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8380#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8382#L24 assume ~n < 2; 8455#L8 assume true; 8451#merge_sortEXIT >#88#return; 8452#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 8472#L11-3 assume !!(merge_~k~0 < merge_~n); 8473#L12 assume !(merge_~j~0 == merge_~n); 8468#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); 8469#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; 8483#L14-2 merge_#t~ite14 := merge_#t~ite13; 8482#L13-2 merge_#t~ite15 := merge_#t~ite14; 8481#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 8480#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8479#L11-3 assume !!(merge_~k~0 < merge_~n); 8477#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; 8478#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 8499#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8498#L11-3 assume !(merge_~k~0 < merge_~n); 8404#L11-4 merge_~i~0 := 0; 8405#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; 8400#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 8401#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; 8396#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 8394#L17-3 assume !(merge_~i~0 < merge_~n); 8395#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 8353#L8 assume true; 8354#merge_sortEXIT >#88#return; 8355#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.alloc(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 8356#L11-3 assume !!(merge_~k~0 < merge_~n); 8582#L12 assume !(merge_~j~0 == merge_~n); 8581#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); 8579#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; 8578#L14-2 merge_#t~ite14 := merge_#t~ite13; 8577#L13-2 merge_#t~ite15 := merge_#t~ite14; 8576#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 8574#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8575#L11-3 assume !!(merge_~k~0 < merge_~n); 8365#L12 [2018-11-28 23:24:42,687 INFO L796 eck$LassoCheckResult]: Loop: 8365#L12 assume !(merge_~j~0 == merge_~n); 8339#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); 8340#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; 8359#L14-2 merge_#t~ite14 := merge_#t~ite13; 8590#L13-2 merge_#t~ite15 := merge_#t~ite14; 8589#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~mem10;havoc merge_#t~mem7;havoc merge_#t~mem4;havoc merge_#t~post5;havoc merge_#t~post9;havoc merge_#t~ite15;havoc merge_#t~post11;havoc merge_#t~post3;havoc merge_#t~ite14;havoc merge_#t~mem8;havoc merge_#t~mem12;havoc merge_#t~ite13;havoc merge_#t~mem6; 8588#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8584#L11-3 assume !!(merge_~k~0 < merge_~n); 8365#L12 [2018-11-28 23:24:42,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:42,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1710153686, now seen corresponding path program 2 times [2018-11-28 23:24:42,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:42,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:42,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:42,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:42,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:42,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:42,750 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2018-11-28 23:24:42,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:42,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:42,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:42,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:42,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:42,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1618831734, now seen corresponding path program 3 times [2018-11-28 23:24:42,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:42,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:42,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:43,299 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-28 23:24:45,412 WARN L180 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 265 DAG size of output: 225 [2018-11-28 23:24:46,353 WARN L180 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 107 [2018-11-28 23:24:46,604 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-28 23:24:46,808 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-28 23:24:48,742 WARN L180 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 269 DAG size of output: 240 [2018-11-28 23:24:50,746 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 143 DAG size of output: 133 [2018-11-28 23:24:50,971 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-11-28 23:24:51,694 WARN L180 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-28 23:24:52,097 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-28 23:24:53,878 WARN L180 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 185 DAG size of output: 178 [2018-11-28 23:24:54,389 WARN L180 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-11-28 23:24:54,392 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:54,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:54,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:54,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:54,392 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:54,392 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:54,392 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:54,392 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:54,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: mergeSort_true-termination.c.i_Iteration16_Lasso [2018-11-28 23:24:54,392 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:54,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:54,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:54,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:54,890 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-28 23:24:54,894 INFO L168 Benchmark]: Toolchain (without parser) took 47490.12 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 775.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 921.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:54,895 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-11-28 23:24:54,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.85 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:54,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.92 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:54,897 INFO L168 Benchmark]: Boogie Preprocessor took 102.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:54,898 INFO L168 Benchmark]: RCFGBuilder took 611.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:54,899 INFO L168 Benchmark]: BuchiAutomizer took 46422.10 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 648.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -38.3 MB). Peak memory consumption was 935.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:54,905 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.18 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 298.85 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 50.92 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 611.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 46422.10 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 648.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -38.3 MB). Peak memory consumption was 935.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...