./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-recursive-malloc/mergeSort.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.25-906a4fb [2020-10-19 18:50:45,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:50:45,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:50:45,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:50:45,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:50:45,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:50:45,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:50:45,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:50:45,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:50:45,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:50:45,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:50:45,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:50:45,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:50:45,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:50:45,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:50:45,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:50:45,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:50:45,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:50:45,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:50:45,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:50:45,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:50:45,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:50:45,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:50:45,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:50:45,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:50:45,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:50:45,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:50:45,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:50:45,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:50:45,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:50:45,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:50:45,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:50:45,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:50:45,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:50:45,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:50:45,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:50:45,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:50:45,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:50:45,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:50:45,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:50:45,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:50:45,462 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:50:45,488 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:50:45,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:50:45,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:50:45,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:50:45,490 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:50:45,491 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:50:45,493 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:50:45,493 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:50:45,494 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:50:45,494 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:50:45,494 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:50:45,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:50:45,495 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:50:45,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:50:45,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:50:45,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:50:45,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:50:45,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:50:45,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:50:45,498 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:50:45,499 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:50:45,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:50:45,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:50:45,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:50:45,500 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:50:45,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:50:45,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:50:45,501 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:50:45,502 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:50:45,503 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:50:45,504 INFO L138 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 [2020-10-19 18:50:45,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:50:45,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:50:45,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:50:45,837 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:50:45,837 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:50:45,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2020-10-19 18:50:45,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d596e6497/e34b333becf04278b3e290dab403c4e8/FLAGba72bf166 [2020-10-19 18:50:46,401 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:50:46,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2020-10-19 18:50:46,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d596e6497/e34b333becf04278b3e290dab403c4e8/FLAGba72bf166 [2020-10-19 18:50:46,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d596e6497/e34b333becf04278b3e290dab403c4e8 [2020-10-19 18:50:46,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:50:46,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:50:46,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:50:46,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:50:46,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:50:46,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:50:46" (1/1) ... [2020-10-19 18:50:46,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35930483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:46, skipping insertion in model container [2020-10-19 18:50:46,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:50:46" (1/1) ... [2020-10-19 18:50:46,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:50:46,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:50:46,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:50:46,991 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:50:47,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:50:47,030 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:50:47,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47 WrapperNode [2020-10-19 18:50:47,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:50:47,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:50:47,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:50:47,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:50:47,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (1/1) ... [2020-10-19 18:50:47,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (1/1) ... [2020-10-19 18:50:47,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:50:47,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:50:47,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:50:47,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:50:47,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (1/1) ... [2020-10-19 18:50:47,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (1/1) ... [2020-10-19 18:50:47,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (1/1) ... [2020-10-19 18:50:47,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (1/1) ... [2020-10-19 18:50:47,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (1/1) ... [2020-10-19 18:50:47,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (1/1) ... [2020-10-19 18:50:47,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (1/1) ... [2020-10-19 18:50:47,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:50:47,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:50:47,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:50:47,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:50:47,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (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 [2020-10-19 18:50:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:50:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2020-10-19 18:50:47,257 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2020-10-19 18:50:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-19 18:50:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:50:47,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:50:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:50:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:50:47,570 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:50:47,571 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-19 18:50:47,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:50:47 BoogieIcfgContainer [2020-10-19 18:50:47,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:50:47,575 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:50:47,575 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:50:47,580 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:50:47,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:47,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:50:46" (1/3) ... [2020-10-19 18:50:47,584 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a98b81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:50:47, skipping insertion in model container [2020-10-19 18:50:47,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:47,584 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:50:47" (2/3) ... [2020-10-19 18:50:47,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a98b81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:50:47, skipping insertion in model container [2020-10-19 18:50:47,585 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:50:47,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:50:47" (3/3) ... [2020-10-19 18:50:47,587 INFO L373 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2020-10-19 18:50:47,646 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:50:47,646 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:50:47,646 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:50:47,646 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:50:47,646 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:50:47,646 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:50:47,646 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:50:47,647 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:50:47,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2020-10-19 18:50:47,696 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-10-19 18:50:47,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:47,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:47,704 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 18:50:47,705 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:50:47,705 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:50:47,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2020-10-19 18:50:47,709 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-10-19 18:50:47,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:47,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:47,710 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 18:50:47,710 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:50:47,720 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet21, main_#t~post20, main_~i~1, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet18;havoc main_#t~nondet18; 30#L35true assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4#L40-3true [2020-10-19 18:50:47,720 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 [2020-10-19 18:50:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash 88447, now seen corresponding path program 1 times [2020-10-19 18:50:47,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:47,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474145839] [2020-10-19 18:50:47,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:47,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:47,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:47,877 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:47,878 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2020-10-19 18:50:47,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:47,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181119697] [2020-10-19 18:50:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:47,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:47,897 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:47,900 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash 84999937, now seen corresponding path program 1 times [2020-10-19 18:50:47,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:47,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312943934] [2020-10-19 18:50:47,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:47,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:47,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:47,975 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:48,175 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:50:48,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:50:48,177 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:50:48,177 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:50:48,177 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:50:48,178 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,178 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:50:48,178 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:50:48,178 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2020-10-19 18:50:48,179 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:50:48,179 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:50:48,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:48,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:48,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:48,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:48,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:48,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:48,627 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:50:48,633 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:48,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:48,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:48,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:48,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:48,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:48,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:48,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:48,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:48,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:48,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:48,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:48,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:48,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:48,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:48,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:48,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:48,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:48,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:48,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:48,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:48,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:48,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:48,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:48,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:48,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:48,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:48,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:48,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:48,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:48,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:48,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:48,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:48,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:48,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:48,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:48,983 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:50:49,016 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-19 18:50:49,017 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:49,023 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:49,027 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:50:49,027 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:50:49,028 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~a~0.base)_1, ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~a~0.base)_1 - 4*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2020-10-19 18:50:49,073 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-19 18:50:49,084 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:50:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:49,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:50:49,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:49,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:50:49,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:49,183 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 [2020-10-19 18:50:49,185 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 3 states. [2020-10-19 18:50:49,257 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 3 states. Result 59 states and 83 transitions. Complement of second has 9 states. [2020-10-19 18:50:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:50:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-10-19 18:50:49,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 2 letters. [2020-10-19 18:50:49,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:49,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-19 18:50:49,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:49,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-19 18:50:49,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:49,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2020-10-19 18:50:49,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-19 18:50:49,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 26 states and 37 transitions. [2020-10-19 18:50:49,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-19 18:50:49,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-19 18:50:49,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2020-10-19 18:50:49,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:49,290 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-10-19 18:50:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2020-10-19 18:50:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-10-19 18:50:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-19 18:50:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2020-10-19 18:50:49,334 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-10-19 18:50:49,334 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-10-19 18:50:49,335 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:50:49,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2020-10-19 18:50:49,337 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-19 18:50:49,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:49,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:49,338 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:50:49,338 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:50:49,338 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 159#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; 160#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 150#L40-3 assume !(main_~i~1 < main_~n~0); 146#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 164#merge_sortENTRY [2020-10-19 18:50:49,338 INFO L796 eck$LassoCheckResult]: Loop: 164#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 153#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 147#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 164#merge_sortENTRY [2020-10-19 18:50:49,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:49,339 INFO L82 PathProgramCache]: Analyzing trace with hash 84999888, now seen corresponding path program 1 times [2020-10-19 18:50:49,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:49,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654021712] [2020-10-19 18:50:49,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:49,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654021712] [2020-10-19 18:50:49,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:50:49,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:50:49,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794423957] [2020-10-19 18:50:49,404 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:50:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2020-10-19 18:50:49,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:49,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13839325] [2020-10-19 18:50:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:49,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:49,430 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:49,433 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:49,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:50:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:50:49,617 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-10-19 18:50:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:49,636 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-10-19 18:50:49,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:50:49,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2020-10-19 18:50:49,639 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-19 18:50:49,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2020-10-19 18:50:49,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-19 18:50:49,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-19 18:50:49,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-10-19 18:50:49,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:49,643 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-19 18:50:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-10-19 18:50:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-10-19 18:50:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-19 18:50:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-10-19 18:50:49,648 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-10-19 18:50:49,648 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-10-19 18:50:49,648 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:50:49,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2020-10-19 18:50:49,649 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-19 18:50:49,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:49,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:49,650 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:49,651 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:50:49,651 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 218#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; 219#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 209#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; 210#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 211#L40-3 assume !(main_~i~1 < main_~n~0); 206#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 223#merge_sortENTRY [2020-10-19 18:50:49,651 INFO L796 eck$LassoCheckResult]: Loop: 223#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 212#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 204#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 223#merge_sortENTRY [2020-10-19 18:50:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash 80563154, now seen corresponding path program 1 times [2020-10-19 18:50:49,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:49,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536222879] [2020-10-19 18:50:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:49,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:49,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:49,685 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:49,686 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 2 times [2020-10-19 18:50:49,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:49,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128552951] [2020-10-19 18:50:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:49,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:49,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:49,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash -829797441, now seen corresponding path program 1 times [2020-10-19 18:50:49,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:49,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965948932] [2020-10-19 18:50:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:49,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965948932] [2020-10-19 18:50:49,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023888133] [2020-10-19 18:50:49,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:50:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:49,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:50:49,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:49,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:50:49,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-19 18:50:49,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124725095] [2020-10-19 18:50:50,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:50,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 18:50:50,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-19 18:50:50,070 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-19 18:50:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:50,146 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-10-19 18:50:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 18:50:50,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2020-10-19 18:50:50,150 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-19 18:50:50,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2020-10-19 18:50:50,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-19 18:50:50,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-19 18:50:50,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2020-10-19 18:50:50,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:50:50,155 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-10-19 18:50:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2020-10-19 18:50:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-10-19 18:50:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-19 18:50:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-10-19 18:50:50,160 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-10-19 18:50:50,161 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-10-19 18:50:50,161 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:50:50,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-10-19 18:50:50,162 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-19 18:50:50,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:50,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:50,164 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-19 18:50:50,164 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:50:50,164 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 325#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; 326#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 315#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; 316#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 317#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; 318#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 336#L40-3 assume !(main_~i~1 < main_~n~0); 311#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 330#merge_sortENTRY [2020-10-19 18:50:50,164 INFO L796 eck$LassoCheckResult]: Loop: 330#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 319#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 310#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 330#merge_sortENTRY [2020-10-19 18:50:50,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash 111829076, now seen corresponding path program 2 times [2020-10-19 18:50:50,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:50,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697967413] [2020-10-19 18:50:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,198 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:50,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:50,199 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 3 times [2020-10-19 18:50:50,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:50,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847729599] [2020-10-19 18:50:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,207 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,215 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:50,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1394618371, now seen corresponding path program 2 times [2020-10-19 18:50:50,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:50,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856172479] [2020-10-19 18:50:50,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:50,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:50,265 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:50,704 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2020-10-19 18:50:50,956 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:50:50,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:50:50,956 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:50:50,957 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:50:50,957 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:50:50,957 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:50,958 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:50:50,958 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:50:50,958 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2020-10-19 18:50:50,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:50:50,958 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:50:50,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:50,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:50,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:50,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:50,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:50,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:50,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:50,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:50,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:51,508 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:50:51,508 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:51,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:51,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:51,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:51,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:51,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:51,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:51,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:51,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:51,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:51,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:51,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:51,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:51,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:51,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:51,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:51,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:51,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:51,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:51,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:51,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:51,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:51,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:51,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:51,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:51,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:51,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:51,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:51,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:51,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:51,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:51,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:51,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:51,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:51,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:51,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:51,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:51,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:51,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:51,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:51,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:51,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:51,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:51,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:51,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:51,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:51,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:51,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:51,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:51,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:51,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:51,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:51,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:51,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:51,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:51,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:51,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:51,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:51,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:51,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:51,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:51,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:51,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:51,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:51,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:51,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:51,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:51,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:51,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:51,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:51,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:51,894 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:50:51,922 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-19 18:50:51,922 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:51,926 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:50:51,928 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:50:51,929 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:50:51,929 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2020-10-19 18:50:51,964 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-10-19 18:50:51,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:51,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:50:51,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:52,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:50:52,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:52,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:50:52,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 18:50:52,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 18:50:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:52,143 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 [2020-10-19 18:50:52,143 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-10-19 18:50:52,205 INFO L75 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. [2020-10-19 18:50:52,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:50:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:50:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-19 18:50:52,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2020-10-19 18:50:52,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:52,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2020-10-19 18:50:52,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:52,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2020-10-19 18:50:52,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:52,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2020-10-19 18:50:52,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-19 18:50:52,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 49 transitions. [2020-10-19 18:50:52,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-19 18:50:52,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-19 18:50:52,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2020-10-19 18:50:52,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:50:52,214 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2020-10-19 18:50:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2020-10-19 18:50:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-10-19 18:50:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-19 18:50:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-10-19 18:50:52,219 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-19 18:50:52,219 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-19 18:50:52,219 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:50:52,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-10-19 18:50:52,220 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-19 18:50:52,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:52,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:52,222 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:52,222 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:52,223 INFO L794 eck$LassoCheckResult]: Stem: 483#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 474#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; 475#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 462#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; 463#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 464#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; 465#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 489#L40-3 assume !(main_~i~1 < main_~n~0); 459#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 479#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 468#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 458#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 485#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 466#L24 assume ~n < 2; 467#L8 assume true; 476#merge_sortEXIT >#86#return; 457#L27-1 [2020-10-19 18:50:52,223 INFO L796 eck$LassoCheckResult]: Loop: 457#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 486#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 488#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 456#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 486#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 488#L24 assume ~n < 2; 472#L8 assume true; 487#merge_sortEXIT >#86#return; 457#L27-1 [2020-10-19 18:50:52,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:52,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744228, now seen corresponding path program 1 times [2020-10-19 18:50:52,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:52,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695538204] [2020-10-19 18:50:52,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:52,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:52,258 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:52,263 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 1 times [2020-10-19 18:50:52,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:52,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031739606] [2020-10-19 18:50:52,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:52,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:52,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:52,283 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:52,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:52,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1064649429, now seen corresponding path program 1 times [2020-10-19 18:50:52,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:52,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262198193] [2020-10-19 18:50:52,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:52,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-19 18:50:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:52,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-19 18:50:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-19 18:50:52,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262198193] [2020-10-19 18:50:52,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116949129] [2020-10-19 18:50:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:50:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:52,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-19 18:50:52,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:52,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:50:52,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2020-10-19 18:50:52,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777983112] [2020-10-19 18:50:53,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-19 18:50:53,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-10-19 18:50:53,073 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 14 states. [2020-10-19 18:50:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:53,531 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2020-10-19 18:50:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-19 18:50:53,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 89 transitions. [2020-10-19 18:50:53,536 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2020-10-19 18:50:53,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 67 states and 85 transitions. [2020-10-19 18:50:53,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-10-19 18:50:53,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-19 18:50:53,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 85 transitions. [2020-10-19 18:50:53,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:50:53,542 INFO L691 BuchiCegarLoop]: Abstraction has 67 states and 85 transitions. [2020-10-19 18:50:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 85 transitions. [2020-10-19 18:50:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2020-10-19 18:50:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-19 18:50:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2020-10-19 18:50:53,554 INFO L714 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2020-10-19 18:50:53,554 INFO L594 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2020-10-19 18:50:53,554 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:50:53,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2020-10-19 18:50:53,556 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2020-10-19 18:50:53,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:53,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:53,559 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:53,559 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:53,559 INFO L794 eck$LassoCheckResult]: Stem: 706#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 695#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; 696#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 678#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; 679#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 680#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; 681#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 736#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; 720#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 719#L40-3 assume !(main_~i~1 < main_~n~0); 686#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 714#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 685#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 683#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 711#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 682#L24 assume ~n < 2; 684#L8 assume true; 697#merge_sortEXIT >#86#return; 688#L27-1 [2020-10-19 18:50:53,559 INFO L796 eck$LassoCheckResult]: Loop: 688#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 712#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 732#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 689#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 712#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 732#L24 assume ~n < 2; 733#L8 assume true; 737#merge_sortEXIT >#86#return; 688#L27-1 [2020-10-19 18:50:53,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 2 times [2020-10-19 18:50:53,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:53,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52485208] [2020-10-19 18:50:53,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:53,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:53,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:53,639 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:53,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:53,639 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 2 times [2020-10-19 18:50:53,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:53,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112018689] [2020-10-19 18:50:53,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:53,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:53,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:53,671 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:53,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:53,671 INFO L82 PathProgramCache]: Analyzing trace with hash -889748845, now seen corresponding path program 2 times [2020-10-19 18:50:53,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:53,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086484493] [2020-10-19 18:50:53,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:53,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:53,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:53,771 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:54,458 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2020-10-19 18:50:54,828 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2020-10-19 18:50:54,904 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:50:54,904 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:50:54,904 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:50:54,904 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:50:54,904 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:50:54,904 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:54,904 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:50:54,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:50:54,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso [2020-10-19 18:50:54,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:50:54,905 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:50:54,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:54,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:50:55,570 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:50:55,570 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:55,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:55,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:55,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:55,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:55,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:55,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:55,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:55,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:55,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:55,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:55,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:55,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:55,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:56,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:56,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:56,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:56,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:56,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:56,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:56,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:56,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:56,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:56,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:56,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:56,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:56,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:56,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:56,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:56,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:56,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:56,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:56,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:56,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:56,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:56,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:56,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:56,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:50:56,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:50:56,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:50:56,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:56,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:56,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:56,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,298 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 18:50:56,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,303 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-19 18:50:56,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:56,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:56,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:56,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:56,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:50:56,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:56,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:50:56,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:50:56,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:50:56,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:50:56,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:50:56,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:50:56,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,497 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:50:56,535 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-19 18:50:56,535 INFO L444 ModelExtractionUtils]: 0 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:50:56,537 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:50:56,540 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-10-19 18:50:56,540 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:50:56,540 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [5*merge_sort_#in~n - 1 >= 0, -6*merge_sort_~n + 6*merge_sort_~m~0 + 5*merge_sort_#in~n >= 0] [2020-10-19 18:50:56,567 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2020-10-19 18:50:56,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:56,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-19 18:50:56,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:56,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-19 18:50:56,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:50:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:50:57,155 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 5 loop predicates [2020-10-19 18:50:57,156 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23 Second operand 14 states. [2020-10-19 18:50:57,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23. Second operand 14 states. Result 317 states and 436 transitions. Complement of second has 38 states. [2020-10-19 18:50:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 9 stem states 4 non-accepting loop states 2 accepting loop states [2020-10-19 18:50:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-19 18:50:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2020-10-19 18:50:57,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 18 letters. Loop has 8 letters. [2020-10-19 18:50:57,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:57,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 26 letters. Loop has 8 letters. [2020-10-19 18:50:57,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:57,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 18 letters. Loop has 16 letters. [2020-10-19 18:50:57,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:50:57,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 436 transitions. [2020-10-19 18:50:58,008 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2020-10-19 18:50:58,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 240 states and 334 transitions. [2020-10-19 18:50:58,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2020-10-19 18:50:58,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 176 [2020-10-19 18:50:58,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 334 transitions. [2020-10-19 18:50:58,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:50:58,024 INFO L691 BuchiCegarLoop]: Abstraction has 240 states and 334 transitions. [2020-10-19 18:50:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 334 transitions. [2020-10-19 18:50:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 214. [2020-10-19 18:50:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-19 18:50:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 288 transitions. [2020-10-19 18:50:58,054 INFO L714 BuchiCegarLoop]: Abstraction has 214 states and 288 transitions. [2020-10-19 18:50:58,054 INFO L594 BuchiCegarLoop]: Abstraction has 214 states and 288 transitions. [2020-10-19 18:50:58,054 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:50:58,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 288 transitions. [2020-10-19 18:50:58,057 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2020-10-19 18:50:58,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:58,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:58,058 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:58,059 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 18:50:58,059 INFO L794 eck$LassoCheckResult]: Stem: 1295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1270#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; 1271#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1245#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; 1246#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1247#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; 1248#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1249#L40-3 assume !(main_~i~1 < main_~n~0); 1237#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1281#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1347#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1304#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1305#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1419#L24 assume ~n < 2; 1418#L8 assume true; 1415#merge_sortEXIT >#86#return; 1251#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1311#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1250#L24 assume ~n < 2; 1252#L8 assume true; 1291#merge_sortEXIT >#88#return; 1292#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1423#L11-3 [2020-10-19 18:50:58,060 INFO L796 eck$LassoCheckResult]: Loop: 1423#L11-3 assume !!(merge_~k~0 < merge_~n); 1424#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; 1440#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 1426#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1423#L11-3 [2020-10-19 18:50:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 1 times [2020-10-19 18:50:58,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:58,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567485964] [2020-10-19 18:50:58,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:58,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:58,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:58,093 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:58,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:58,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2020-10-19 18:50:58,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:58,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113804460] [2020-10-19 18:50:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:58,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:58,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:58,105 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash -782974256, now seen corresponding path program 1 times [2020-10-19 18:50:58,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:58,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115484211] [2020-10-19 18:50:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:58,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-19 18:50:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:58,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-19 18:50:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:50:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-19 18:50:58,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115484211] [2020-10-19 18:50:58,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:50:58,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 18:50:58,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630581142] [2020-10-19 18:50:58,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:50:58,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 18:50:58,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 18:50:58,271 INFO L87 Difference]: Start difference. First operand 214 states and 288 transitions. cyclomatic complexity: 98 Second operand 5 states. [2020-10-19 18:50:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:50:58,389 INFO L93 Difference]: Finished difference Result 346 states and 486 transitions. [2020-10-19 18:50:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 18:50:58,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 346 states and 486 transitions. [2020-10-19 18:50:58,397 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 136 [2020-10-19 18:50:58,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 346 states to 346 states and 486 transitions. [2020-10-19 18:50:58,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2020-10-19 18:50:58,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2020-10-19 18:50:58,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 346 states and 486 transitions. [2020-10-19 18:50:58,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:50:58,407 INFO L691 BuchiCegarLoop]: Abstraction has 346 states and 486 transitions. [2020-10-19 18:50:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states and 486 transitions. [2020-10-19 18:50:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 268. [2020-10-19 18:50:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-10-19 18:50:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 351 transitions. [2020-10-19 18:50:58,454 INFO L714 BuchiCegarLoop]: Abstraction has 268 states and 351 transitions. [2020-10-19 18:50:58,454 INFO L594 BuchiCegarLoop]: Abstraction has 268 states and 351 transitions. [2020-10-19 18:50:58,455 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:50:58,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 268 states and 351 transitions. [2020-10-19 18:50:58,458 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2020-10-19 18:50:58,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:50:58,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:50:58,459 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:58,460 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:50:58,460 INFO L794 eck$LassoCheckResult]: Stem: 1878#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1854#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; 1855#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1826#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; 1827#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1828#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; 1829#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1830#L40-3 assume !(main_~i~1 < main_~n~0); 1818#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1862#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1934#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1887#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1888#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2003#L24 assume ~n < 2; 2002#L8 assume true; 2001#merge_sortEXIT >#86#return; 1874#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1889#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 2076#L24 assume ~n < 2; 2075#L8 assume true; 1873#merge_sortEXIT >#88#return; 1858#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1859#L11-3 [2020-10-19 18:50:58,461 INFO L796 eck$LassoCheckResult]: Loop: 1859#L11-3 assume !!(merge_~k~0 < merge_~n); 1867#L12 assume !(merge_~j~0 == merge_~n); 1837#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); 1839#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; 1864#L14-2 merge_#t~ite14 := merge_#t~ite13; 1850#L13-2 merge_#t~ite15 := merge_#t~ite14; 1851#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 1870#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1859#L11-3 [2020-10-19 18:50:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:58,461 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 2 times [2020-10-19 18:50:58,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:58,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339572627] [2020-10-19 18:50:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:58,486 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:58,516 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:58,532 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2020-10-19 18:50:58,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:58,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506445346] [2020-10-19 18:50:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:58,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:58,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:58,557 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:50:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash 389830265, now seen corresponding path program 1 times [2020-10-19 18:50:58,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:50:58,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602786670] [2020-10-19 18:50:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:50:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:58,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:50:58,633 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:50:58,641 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:50:58,781 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2020-10-19 18:50:59,311 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 125 [2020-10-19 18:50:59,474 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2020-10-19 18:50:59,684 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-10-19 18:51:00,351 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 121 [2020-10-19 18:51:00,510 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-19 18:51:00,513 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:51:00,513 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:51:00,513 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:51:00,513 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:51:00,513 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:51:00,513 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:00,514 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:51:00,514 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:51:00,514 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso [2020-10-19 18:51:00,514 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:51:00,514 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:51:00,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:00,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:01,023 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2020-10-19 18:51:01,175 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2020-10-19 18:51:01,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:01,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:01,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:01,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:01,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:01,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:01,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:01,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:01,637 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2020-10-19 18:51:02,009 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-10-19 18:51:02,197 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-19 18:51:02,441 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-19 18:51:02,468 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:51:02,471 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:02,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:02,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:02,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:02,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:02,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:02,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:02,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:02,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:02,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:02,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:02,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:02,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:02,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:02,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:02,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:03,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:03,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:03,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:03,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:03,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:03,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:03,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:03,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:03,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:03,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:03,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:03,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:03,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:03,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:03,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:03,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,194 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-10-19 18:51:03,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,201 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-19 18:51:03,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:03,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:03,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:03,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:03,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:03,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:03,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:03,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:03,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:03,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:03,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:03,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:03,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:03,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:03,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:03,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:03,395 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-10-19 18:51:03,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:03,482 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2020-10-19 18:51:03,483 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2020-10-19 18:51:04,414 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:51:06,957 INFO L443 ModelExtractionUtils]: Simplification made 67 calls to the SMT solver. [2020-10-19 18:51:06,957 INFO L444 ModelExtractionUtils]: 102 out of 208 variables were initially zero. Simplification set additionally 102 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:06,959 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:06,970 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2020-10-19 18:51:06,971 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:51:06,971 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_merge_~a.base)_1, merge_sort_merge_~a.offset, merge_sort_merge_~i~0) = 1*v_rep(select #length merge_sort_merge_~a.base)_1 - 1*merge_sort_merge_~a.offset - 4*merge_sort_merge_~i~0 Supporting invariants [] [2020-10-19 18:51:07,033 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-19 18:51:07,035 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:51:07,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:07,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:07,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:07,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:51:07,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:07,171 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-10-19 18:51:07,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 268 states and 351 transitions. cyclomatic complexity: 107 Second operand 6 states. [2020-10-19 18:51:07,284 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 268 states and 351 transitions. cyclomatic complexity: 107. Second operand 6 states. Result 724 states and 975 transitions. Complement of second has 14 states. [2020-10-19 18:51:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:51:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 18:51:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-10-19 18:51:07,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 22 letters. Loop has 8 letters. [2020-10-19 18:51:07,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:07,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 30 letters. Loop has 8 letters. [2020-10-19 18:51:07,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:07,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 22 letters. Loop has 16 letters. [2020-10-19 18:51:07,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:07,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 724 states and 975 transitions. [2020-10-19 18:51:07,303 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 208 [2020-10-19 18:51:07,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 724 states to 706 states and 939 transitions. [2020-10-19 18:51:07,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2020-10-19 18:51:07,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2020-10-19 18:51:07,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 706 states and 939 transitions. [2020-10-19 18:51:07,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:07,318 INFO L691 BuchiCegarLoop]: Abstraction has 706 states and 939 transitions. [2020-10-19 18:51:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states and 939 transitions. [2020-10-19 18:51:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 515. [2020-10-19 18:51:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-10-19 18:51:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 703 transitions. [2020-10-19 18:51:07,359 INFO L714 BuchiCegarLoop]: Abstraction has 515 states and 703 transitions. [2020-10-19 18:51:07,360 INFO L594 BuchiCegarLoop]: Abstraction has 515 states and 703 transitions. [2020-10-19 18:51:07,360 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 18:51:07,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 515 states and 703 transitions. [2020-10-19 18:51:07,363 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 166 [2020-10-19 18:51:07,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:07,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:07,365 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:07,365 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-19 18:51:07,366 INFO L794 eck$LassoCheckResult]: Stem: 3052#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3023#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; 3024#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 2988#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; 2989#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2990#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; 2991#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2992#L40-3 assume !(main_~i~1 < main_~n~0); 2979#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 3036#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3124#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3118#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 3120#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3125#L24 assume ~n < 2; 3122#L8 assume true; 3117#merge_sortEXIT >#86#return; 3114#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 3115#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3127#L24 assume ~n < 2; 3128#L8 assume true; 3132#merge_sortEXIT >#88#return; 3111#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 3112#L11-3 assume !!(merge_~k~0 < merge_~n); 3109#L12 [2020-10-19 18:51:07,366 INFO L796 eck$LassoCheckResult]: Loop: 3109#L12 assume !(merge_~j~0 == merge_~n); 3151#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; 3149#L13-2 merge_#t~ite15 := merge_#t~ite14; 3133#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 3110#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 3108#L11-3 assume !!(merge_~k~0 < merge_~n); 3109#L12 [2020-10-19 18:51:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 1 times [2020-10-19 18:51:07,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:07,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498239137] [2020-10-19 18:51:07,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:07,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:07,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:07,403 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:07,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1482376367, now seen corresponding path program 1 times [2020-10-19 18:51:07,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:07,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265091375] [2020-10-19 18:51:07,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:07,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:07,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:07,426 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:07,428 INFO L82 PathProgramCache]: Analyzing trace with hash 426493234, now seen corresponding path program 1 times [2020-10-19 18:51:07,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:07,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659600143] [2020-10-19 18:51:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:07,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-19 18:51:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:07,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-19 18:51:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-19 18:51:07,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659600143] [2020-10-19 18:51:07,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:51:07,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 18:51:07,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907957199] [2020-10-19 18:51:07,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:07,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 18:51:07,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 18:51:07,579 INFO L87 Difference]: Start difference. First operand 515 states and 703 transitions. cyclomatic complexity: 232 Second operand 5 states. [2020-10-19 18:51:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:07,679 INFO L93 Difference]: Finished difference Result 726 states and 976 transitions. [2020-10-19 18:51:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 18:51:07,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 726 states and 976 transitions. [2020-10-19 18:51:07,689 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 246 [2020-10-19 18:51:07,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 726 states to 726 states and 976 transitions. [2020-10-19 18:51:07,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 384 [2020-10-19 18:51:07,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 384 [2020-10-19 18:51:07,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 726 states and 976 transitions. [2020-10-19 18:51:07,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:07,705 INFO L691 BuchiCegarLoop]: Abstraction has 726 states and 976 transitions. [2020-10-19 18:51:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states and 976 transitions. [2020-10-19 18:51:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 704. [2020-10-19 18:51:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2020-10-19 18:51:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 941 transitions. [2020-10-19 18:51:07,736 INFO L714 BuchiCegarLoop]: Abstraction has 704 states and 941 transitions. [2020-10-19 18:51:07,737 INFO L594 BuchiCegarLoop]: Abstraction has 704 states and 941 transitions. [2020-10-19 18:51:07,737 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 18:51:07,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 704 states and 941 transitions. [2020-10-19 18:51:07,743 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 244 [2020-10-19 18:51:07,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:07,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:07,745 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:07,745 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:07,745 INFO L794 eck$LassoCheckResult]: Stem: 4316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4286#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; 4287#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4251#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; 4252#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4253#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; 4254#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4255#L40-3 assume !(main_~i~1 < main_~n~0); 4243#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 4298#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4438#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4429#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4430#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4437#L24 assume ~n < 2; 4435#L8 assume true; 4428#merge_sortEXIT >#86#return; 4424#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 4426#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4431#L24 assume ~n < 2; 4427#L8 assume true; 4423#merge_sortEXIT >#88#return; 4420#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 4421#L11-3 assume !!(merge_~k~0 < merge_~n); 4411#L12 [2020-10-19 18:51:07,746 INFO L796 eck$LassoCheckResult]: Loop: 4411#L12 assume !(merge_~j~0 == merge_~n); 4476#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); 4472#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; 4467#L14-2 merge_#t~ite14 := merge_#t~ite13; 4463#L13-2 merge_#t~ite15 := merge_#t~ite14; 4464#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 4419#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 4410#L11-3 assume !!(merge_~k~0 < merge_~n); 4411#L12 [2020-10-19 18:51:07,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 2 times [2020-10-19 18:51:07,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:07,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779271893] [2020-10-19 18:51:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:07,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:07,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:07,777 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2020-10-19 18:51:07,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:07,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070171627] [2020-10-19 18:51:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:07,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:07,789 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:07,790 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:07,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:07,791 INFO L82 PathProgramCache]: Analyzing trace with hash -857421960, now seen corresponding path program 1 times [2020-10-19 18:51:07,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:07,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470276659] [2020-10-19 18:51:07,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:07,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:07,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:07,837 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:07,986 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2020-10-19 18:51:08,535 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2020-10-19 18:51:08,802 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2020-10-19 18:51:09,443 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 118 [2020-10-19 18:51:09,601 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-19 18:51:09,604 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:51:09,604 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:51:09,604 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:51:09,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:51:09,604 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:51:09,604 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:09,604 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:51:09,604 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:51:09,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration10_Lasso [2020-10-19 18:51:09,605 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:51:09,605 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:51:09,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:09,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:09,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:09,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:09,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:09,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:09,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,092 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 117 [2020-10-19 18:51:10,263 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-10-19 18:51:10,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:10,616 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-19 18:51:11,003 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-19 18:51:11,273 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-19 18:51:11,532 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-10-19 18:51:11,656 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:51:11,656 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:11,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:11,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:11,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:11,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:11,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:11,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:11,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:11,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:11,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:11,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:11,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:11,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:11,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:11,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:11,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:11,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:11,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:11,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:11,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:11,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:11,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:11,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:11,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:11,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:11,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:11,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:11,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:11,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:11,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:11,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:11,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:11,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:11,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:11,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:11,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:11,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:11,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:11,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:11,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:11,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:11,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:11,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:11,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:11,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:11,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:11,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:11,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:11,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:11,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:11,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:11,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:11,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:11,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:11,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:11,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:11,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:11,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:11,818 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-10-19 18:51:11,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:11,909 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2020-10-19 18:51:11,910 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2020-10-19 18:51:12,565 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:51:14,553 INFO L443 ModelExtractionUtils]: Simplification made 66 calls to the SMT solver. [2020-10-19 18:51:14,553 INFO L444 ModelExtractionUtils]: 96 out of 208 variables were initially zero. Simplification set additionally 108 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:14,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:51:14,562 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2020-10-19 18:51:14,563 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:51:14,563 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_merge_~a.base)_2, merge_sort_merge_~i~0, merge_sort_merge_~j~0) = 1*v_rep(select #length merge_sort_merge_~a.base)_2 + 2*merge_sort_merge_~i~0 - 2*merge_sort_merge_~j~0 Supporting invariants [] [2020-10-19 18:51:14,634 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2020-10-19 18:51:14,636 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:51:14,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:14,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:14,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:14,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 18:51:14,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:14,803 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-10-19 18:51:14,803 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 704 states and 941 transitions. cyclomatic complexity: 290 Second operand 6 states. [2020-10-19 18:51:14,947 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 704 states and 941 transitions. cyclomatic complexity: 290. Second operand 6 states. Result 1278 states and 1682 transitions. Complement of second has 14 states. [2020-10-19 18:51:14,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:51:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 18:51:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-10-19 18:51:14,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 23 letters. Loop has 8 letters. [2020-10-19 18:51:14,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:14,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 31 letters. Loop has 8 letters. [2020-10-19 18:51:14,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:14,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 23 letters. Loop has 16 letters. [2020-10-19 18:51:14,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:14,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1278 states and 1682 transitions. [2020-10-19 18:51:14,969 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 268 [2020-10-19 18:51:14,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1278 states to 1231 states and 1618 transitions. [2020-10-19 18:51:14,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2020-10-19 18:51:14,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 557 [2020-10-19 18:51:14,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1231 states and 1618 transitions. [2020-10-19 18:51:14,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:14,989 INFO L691 BuchiCegarLoop]: Abstraction has 1231 states and 1618 transitions. [2020-10-19 18:51:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states and 1618 transitions. [2020-10-19 18:51:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1190. [2020-10-19 18:51:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2020-10-19 18:51:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1573 transitions. [2020-10-19 18:51:15,024 INFO L714 BuchiCegarLoop]: Abstraction has 1190 states and 1573 transitions. [2020-10-19 18:51:15,024 INFO L594 BuchiCegarLoop]: Abstraction has 1190 states and 1573 transitions. [2020-10-19 18:51:15,024 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 18:51:15,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1190 states and 1573 transitions. [2020-10-19 18:51:15,032 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 264 [2020-10-19 18:51:15,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:15,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:15,034 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:15,034 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:51:15,034 INFO L794 eck$LassoCheckResult]: Stem: 6490#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6460#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; 6461#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 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; 6426#L40-3 assume !(main_~i~1 < main_~n~0); 6404#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 6473#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6804#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6792#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6793#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6805#L24 assume ~n < 2; 6803#L8 assume true; 6791#merge_sortEXIT >#86#return; 6783#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6788#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6821#L24 assume ~n < 2; 6820#L8 assume true; 6782#merge_sortEXIT >#88#return; 6784#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 6947#L11-3 assume !(merge_~k~0 < merge_~n); 6777#L11-4 merge_~i~0 := 0; 6403#L17-3 [2020-10-19 18:51:15,035 INFO L796 eck$LassoCheckResult]: Loop: 6403#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; 6406#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 6403#L17-3 [2020-10-19 18:51:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1013709224, now seen corresponding path program 1 times [2020-10-19 18:51:15,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:15,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499239814] [2020-10-19 18:51:15,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:15,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-19 18:51:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:15,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-19 18:51:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-19 18:51:15,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499239814] [2020-10-19 18:51:15,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:51:15,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 18:51:15,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784630187] [2020-10-19 18:51:15,084 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2020-10-19 18:51:15,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:15,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628170581] [2020-10-19 18:51:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:15,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:15,090 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:15,092 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:15,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:15,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 18:51:15,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 18:51:15,134 INFO L87 Difference]: Start difference. First operand 1190 states and 1573 transitions. cyclomatic complexity: 474 Second operand 5 states. [2020-10-19 18:51:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:15,256 INFO L93 Difference]: Finished difference Result 1292 states and 1596 transitions. [2020-10-19 18:51:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 18:51:15,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1292 states and 1596 transitions. [2020-10-19 18:51:15,270 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 246 [2020-10-19 18:51:15,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1292 states to 1292 states and 1596 transitions. [2020-10-19 18:51:15,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 514 [2020-10-19 18:51:15,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 514 [2020-10-19 18:51:15,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1292 states and 1596 transitions. [2020-10-19 18:51:15,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:15,294 INFO L691 BuchiCegarLoop]: Abstraction has 1292 states and 1596 transitions. [2020-10-19 18:51:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states and 1596 transitions. [2020-10-19 18:51:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 954. [2020-10-19 18:51:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2020-10-19 18:51:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1210 transitions. [2020-10-19 18:51:15,330 INFO L714 BuchiCegarLoop]: Abstraction has 954 states and 1210 transitions. [2020-10-19 18:51:15,330 INFO L594 BuchiCegarLoop]: Abstraction has 954 states and 1210 transitions. [2020-10-19 18:51:15,330 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 18:51:15,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 954 states and 1210 transitions. [2020-10-19 18:51:15,337 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 244 [2020-10-19 18:51:15,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:15,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:15,341 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:15,342 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:51:15,343 INFO L794 eck$LassoCheckResult]: Stem: 8984#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8947#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; 8948#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 8915#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; 8916#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8917#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; 8918#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8919#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; 9007#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9006#L40-3 assume !(main_~i~1 < main_~n~0); 8907#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 9028#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9023#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9002#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9032#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9027#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9001#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9003#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9026#L24 assume ~n < 2; 9209#L8 assume true; 9208#merge_sortEXIT >#86#return; 8927#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 9207#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9205#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9193#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9197#merge_sortENTRY [2020-10-19 18:51:15,344 INFO L796 eck$LassoCheckResult]: Loop: 9197#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9199#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9191#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9197#merge_sortENTRY [2020-10-19 18:51:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash 384755823, now seen corresponding path program 3 times [2020-10-19 18:51:15,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:15,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701106750] [2020-10-19 18:51:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:15,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-19 18:51:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 18:51:15,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701106750] [2020-10-19 18:51:15,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545663221] [2020-10-19 18:51:15,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:15,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-19 18:51:15,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:51:15,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 18:51:15,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:15,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:51:15,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 18:51:15,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 18:51:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-19 18:51:15,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:15,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2020-10-19 18:51:15,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764540487] [2020-10-19 18:51:15,615 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:15,615 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 4 times [2020-10-19 18:51:15,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:15,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674470340] [2020-10-19 18:51:15,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:15,620 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:15,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:15,624 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:15,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-19 18:51:15,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-10-19 18:51:15,771 INFO L87 Difference]: Start difference. First operand 954 states and 1210 transitions. cyclomatic complexity: 327 Second operand 14 states. [2020-10-19 18:51:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:16,131 INFO L93 Difference]: Finished difference Result 1078 states and 1373 transitions. [2020-10-19 18:51:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-19 18:51:16,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1078 states and 1373 transitions. [2020-10-19 18:51:16,142 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 284 [2020-10-19 18:51:16,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1078 states to 1074 states and 1369 transitions. [2020-10-19 18:51:16,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 468 [2020-10-19 18:51:16,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 471 [2020-10-19 18:51:16,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1074 states and 1369 transitions. [2020-10-19 18:51:16,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:16,155 INFO L691 BuchiCegarLoop]: Abstraction has 1074 states and 1369 transitions. [2020-10-19 18:51:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states and 1369 transitions. [2020-10-19 18:51:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 988. [2020-10-19 18:51:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2020-10-19 18:51:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1256 transitions. [2020-10-19 18:51:16,195 INFO L714 BuchiCegarLoop]: Abstraction has 988 states and 1256 transitions. [2020-10-19 18:51:16,195 INFO L594 BuchiCegarLoop]: Abstraction has 988 states and 1256 transitions. [2020-10-19 18:51:16,195 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 18:51:16,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1256 transitions. [2020-10-19 18:51:16,202 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 264 [2020-10-19 18:51:16,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:16,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:16,204 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:16,204 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:51:16,204 INFO L794 eck$LassoCheckResult]: Stem: 11124#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11092#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; 11093#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 11065#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; 11066#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11067#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; 11068#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11069#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; 11166#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11140#L40-3 assume !(main_~i~1 < main_~n~0); 11050#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 11180#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11177#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11171#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11173#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11178#L24 assume ~n < 2; 11175#L8 assume true; 11170#merge_sortEXIT >#86#return; 11077#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 11169#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11159#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11082#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11232#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11303#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11304#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11359#merge_sortENTRY [2020-10-19 18:51:16,204 INFO L796 eck$LassoCheckResult]: Loop: 11359#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11362#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11352#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11359#merge_sortENTRY [2020-10-19 18:51:16,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:16,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1495319133, now seen corresponding path program 4 times [2020-10-19 18:51:16,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:16,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308440854] [2020-10-19 18:51:16,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:16,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-19 18:51:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:16,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308440854] [2020-10-19 18:51:16,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890391893] [2020-10-19 18:51:16,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:16,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 18:51:16,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:51:16,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-19 18:51:16,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:16,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:51:16,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 18:51:16,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 18:51:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:16,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:16,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2020-10-19 18:51:16,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271987462] [2020-10-19 18:51:16,711 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:16,711 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 5 times [2020-10-19 18:51:16,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:16,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4101349] [2020-10-19 18:51:16,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:16,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:16,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:16,719 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:16,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:16,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-19 18:51:16,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-10-19 18:51:16,875 INFO L87 Difference]: Start difference. First operand 988 states and 1256 transitions. cyclomatic complexity: 340 Second operand 18 states. [2020-10-19 18:51:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:17,559 INFO L93 Difference]: Finished difference Result 1166 states and 1473 transitions. [2020-10-19 18:51:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-19 18:51:17,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1166 states and 1473 transitions. [2020-10-19 18:51:17,570 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 298 [2020-10-19 18:51:17,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1166 states to 1159 states and 1466 transitions. [2020-10-19 18:51:17,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 508 [2020-10-19 18:51:17,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 511 [2020-10-19 18:51:17,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1159 states and 1466 transitions. [2020-10-19 18:51:17,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:17,581 INFO L691 BuchiCegarLoop]: Abstraction has 1159 states and 1466 transitions. [2020-10-19 18:51:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states and 1466 transitions. [2020-10-19 18:51:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1076. [2020-10-19 18:51:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2020-10-19 18:51:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1356 transitions. [2020-10-19 18:51:17,611 INFO L714 BuchiCegarLoop]: Abstraction has 1076 states and 1356 transitions. [2020-10-19 18:51:17,611 INFO L594 BuchiCegarLoop]: Abstraction has 1076 states and 1356 transitions. [2020-10-19 18:51:17,611 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 18:51:17,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1076 states and 1356 transitions. [2020-10-19 18:51:17,620 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 280 [2020-10-19 18:51:17,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:17,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:17,621 INFO L852 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] [2020-10-19 18:51:17,621 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-19 18:51:17,621 INFO L794 eck$LassoCheckResult]: Stem: 13404#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13373#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; 13374#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 13341#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; 13342#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13343#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; 13344#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13345#L40-3 assume !(main_~i~1 < main_~n~0); 13333#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 13388#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13688#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 13689#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 13701#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13702#L24 assume ~n < 2; 13697#L8 assume true; 13698#merge_sortEXIT >#86#return; 13681#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 13682#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13696#L24 assume ~n < 2; 13690#L8 assume true; 13691#merge_sortEXIT >#88#return; 13678#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 13676#L11-3 assume !!(merge_~k~0 < merge_~n); 13674#L12 assume !(merge_~j~0 == merge_~n); 13649#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); 13672#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; 13671#L14-2 merge_#t~ite14 := merge_#t~ite13; 13369#L13-2 [2020-10-19 18:51:17,622 INFO L796 eck$LassoCheckResult]: Loop: 13369#L13-2 merge_#t~ite15 := merge_#t~ite14; 13370#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 13637#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13638#L11-3 assume !!(merge_~k~0 < merge_~n); 13391#L12 assume !(merge_~j~0 == merge_~n); 13392#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; 13369#L13-2 [2020-10-19 18:51:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:17,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1497650635, now seen corresponding path program 1 times [2020-10-19 18:51:17,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:17,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038835559] [2020-10-19 18:51:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:17,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:17,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:17,657 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1895288687, now seen corresponding path program 2 times [2020-10-19 18:51:17,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:17,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181869992] [2020-10-19 18:51:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:17,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:17,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:17,668 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash -158128711, now seen corresponding path program 1 times [2020-10-19 18:51:17,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:17,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187218235] [2020-10-19 18:51:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:17,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:17,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:17,710 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:18,510 WARN L193 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 161 [2020-10-19 18:51:18,795 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2020-10-19 18:51:19,034 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2020-10-19 18:51:19,242 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-19 18:51:19,378 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-19 18:51:19,968 WARN L193 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 149 [2020-10-19 18:51:20,187 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-19 18:51:20,191 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:51:20,191 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:51:20,191 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:51:20,191 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:51:20,191 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:51:20,191 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:20,192 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:51:20,192 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:51:20,192 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration14_Lasso [2020-10-19 18:51:20,192 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:51:20,192 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:51:20,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,768 WARN L193 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 127 [2020-10-19 18:51:20,923 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2020-10-19 18:51:20,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:20,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:21,280 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2020-10-19 18:51:21,679 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-19 18:51:21,829 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-19 18:51:22,105 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-10-19 18:51:22,255 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:51:22,255 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:22,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:22,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:22,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:22,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:22,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:22,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:22,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:22,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:22,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:22,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:22,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:22,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:22,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:22,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:22,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:22,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:22,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:22,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:22,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:22,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:22,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:22,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:22,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:22,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:22,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:22,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:22,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:22,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:22,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:22,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:22,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:22,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:22,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:22,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:22,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:22,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:22,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:22,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:22,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:22,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:22,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:22,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:22,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:22,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:22,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:22,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:22,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:22,433 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 18:51:22,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:22,469 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-19 18:51:22,470 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-19 18:51:22,598 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:51:22,822 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2020-10-19 18:51:22,822 INFO L444 ModelExtractionUtils]: 59 out of 126 variables were initially zero. Simplification set additionally 64 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:22,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:51:22,826 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-19 18:51:22,827 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:51:22,827 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~k~0, merge_sort_merge_~n) = -1*merge_sort_merge_~k~0 + 1*merge_sort_merge_~n Supporting invariants [] [2020-10-19 18:51:22,887 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-19 18:51:22,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:22,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:22,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:22,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:51:22,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:23,002 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-10-19 18:51:23,002 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1076 states and 1356 transitions. cyclomatic complexity: 358 Second operand 6 states. [2020-10-19 18:51:23,104 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1076 states and 1356 transitions. cyclomatic complexity: 358. Second operand 6 states. Result 1908 states and 2417 transitions. Complement of second has 14 states. [2020-10-19 18:51:23,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:51:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 18:51:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-10-19 18:51:23,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 27 letters. Loop has 6 letters. [2020-10-19 18:51:23,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:23,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 33 letters. Loop has 6 letters. [2020-10-19 18:51:23,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:23,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 27 letters. Loop has 12 letters. [2020-10-19 18:51:23,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:23,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1908 states and 2417 transitions. [2020-10-19 18:51:23,127 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 182 [2020-10-19 18:51:23,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1908 states to 1531 states and 1950 transitions. [2020-10-19 18:51:23,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2020-10-19 18:51:23,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 630 [2020-10-19 18:51:23,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1531 states and 1950 transitions. [2020-10-19 18:51:23,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:23,146 INFO L691 BuchiCegarLoop]: Abstraction has 1531 states and 1950 transitions. [2020-10-19 18:51:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states and 1950 transitions. [2020-10-19 18:51:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1180. [2020-10-19 18:51:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2020-10-19 18:51:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1577 transitions. [2020-10-19 18:51:23,181 INFO L714 BuchiCegarLoop]: Abstraction has 1180 states and 1577 transitions. [2020-10-19 18:51:23,182 INFO L594 BuchiCegarLoop]: Abstraction has 1180 states and 1577 transitions. [2020-10-19 18:51:23,182 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-19 18:51:23,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1180 states and 1577 transitions. [2020-10-19 18:51:23,253 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 176 [2020-10-19 18:51:23,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:23,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:23,255 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:23,255 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:51:23,255 INFO L794 eck$LassoCheckResult]: Stem: 16565#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 16534#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; 16535#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 16503#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; 16504#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 16505#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; 16506#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 16507#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; 16583#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 16610#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; 16609#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 16608#L40-3 assume !(main_~i~1 < main_~n~0); 16496#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 16607#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 16601#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 16578#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 16614#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 16616#L24 assume ~n < 2; 16615#L8 assume true; 16613#merge_sortEXIT >#86#return; 16514#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 16573#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 16574#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 16498#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 16661#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 16859#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 16861#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 16907#merge_sortENTRY [2020-10-19 18:51:23,255 INFO L796 eck$LassoCheckResult]: Loop: 16907#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 16912#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 16895#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 16907#merge_sortENTRY [2020-10-19 18:51:23,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:23,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1038514783, now seen corresponding path program 5 times [2020-10-19 18:51:23,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:23,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742420206] [2020-10-19 18:51:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:23,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-19 18:51:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:23,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742420206] [2020-10-19 18:51:23,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308472976] [2020-10-19 18:51:23,532 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:23,584 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2020-10-19 18:51:23,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:51:23,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 18:51:23,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:23,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:51:23,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 18:51:23,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 18:51:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-19 18:51:23,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:23,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2020-10-19 18:51:23,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691954401] [2020-10-19 18:51:23,841 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 6 times [2020-10-19 18:51:23,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:23,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114269841] [2020-10-19 18:51:23,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:23,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:23,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:23,851 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:23,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:23,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-19 18:51:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2020-10-19 18:51:23,996 INFO L87 Difference]: Start difference. First operand 1180 states and 1577 transitions. cyclomatic complexity: 471 Second operand 26 states. [2020-10-19 18:51:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:26,049 INFO L93 Difference]: Finished difference Result 1020 states and 1357 transitions. [2020-10-19 18:51:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-10-19 18:51:26,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1020 states and 1357 transitions. [2020-10-19 18:51:26,058 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 356 [2020-10-19 18:51:26,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1020 states to 1009 states and 1345 transitions. [2020-10-19 18:51:26,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 644 [2020-10-19 18:51:26,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2020-10-19 18:51:26,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1009 states and 1345 transitions. [2020-10-19 18:51:26,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:26,068 INFO L691 BuchiCegarLoop]: Abstraction has 1009 states and 1345 transitions. [2020-10-19 18:51:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states and 1345 transitions. [2020-10-19 18:51:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 772. [2020-10-19 18:51:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-10-19 18:51:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1021 transitions. [2020-10-19 18:51:26,092 INFO L714 BuchiCegarLoop]: Abstraction has 772 states and 1021 transitions. [2020-10-19 18:51:26,092 INFO L594 BuchiCegarLoop]: Abstraction has 772 states and 1021 transitions. [2020-10-19 18:51:26,092 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-19 18:51:26,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 772 states and 1021 transitions. [2020-10-19 18:51:26,097 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-19 18:51:26,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:26,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:26,098 INFO L852 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] [2020-10-19 18:51:26,098 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:51:26,098 INFO L794 eck$LassoCheckResult]: Stem: 18942#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 18916#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; 18917#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 18885#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; 18886#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 18887#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; 18888#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 18889#L40-3 assume !(main_~i~1 < main_~n~0); 18882#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 18923#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 18965#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 18966#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 19076#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 19070#L24 assume ~n < 2; 18973#L8 assume true; 18974#merge_sortEXIT >#86#return; 18891#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 18951#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 18890#L24 assume ~n < 2; 18892#L8 assume true; 19410#merge_sortEXIT >#88#return; 19408#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 19403#L11-3 assume !!(merge_~k~0 < merge_~n); 19404#L12 assume !(merge_~j~0 == merge_~n); 19402#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); 19395#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; 19396#L14-2 merge_#t~ite14 := merge_#t~ite13; 19423#L13-2 merge_#t~ite15 := merge_#t~ite14; 19366#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 19624#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 19226#L11-3 assume !(merge_~k~0 < merge_~n); 18943#L11-4 merge_~i~0 := 0; 18879#L17-3 [2020-10-19 18:51:26,098 INFO L796 eck$LassoCheckResult]: Loop: 18879#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; 18881#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 18879#L17-3 [2020-10-19 18:51:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash 964730358, now seen corresponding path program 1 times [2020-10-19 18:51:26,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:26,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608084177] [2020-10-19 18:51:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:26,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-19 18:51:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:26,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-19 18:51:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-19 18:51:26,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608084177] [2020-10-19 18:51:26,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772151865] [2020-10-19 18:51:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:26,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:51:26,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-19 18:51:26,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:26,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-10-19 18:51:26,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80943362] [2020-10-19 18:51:26,291 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2020-10-19 18:51:26,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:26,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255986994] [2020-10-19 18:51:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,298 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,300 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:26,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:26,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 18:51:26,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-19 18:51:26,351 INFO L87 Difference]: Start difference. First operand 772 states and 1021 transitions. cyclomatic complexity: 296 Second operand 8 states. [2020-10-19 18:51:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:26,479 INFO L93 Difference]: Finished difference Result 1430 states and 1785 transitions. [2020-10-19 18:51:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 18:51:26,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1430 states and 1785 transitions. [2020-10-19 18:51:26,491 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-19 18:51:26,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1430 states to 1406 states and 1755 transitions. [2020-10-19 18:51:26,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 676 [2020-10-19 18:51:26,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 676 [2020-10-19 18:51:26,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1406 states and 1755 transitions. [2020-10-19 18:51:26,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:26,503 INFO L691 BuchiCegarLoop]: Abstraction has 1406 states and 1755 transitions. [2020-10-19 18:51:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states and 1755 transitions. [2020-10-19 18:51:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 814. [2020-10-19 18:51:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2020-10-19 18:51:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1052 transitions. [2020-10-19 18:51:26,525 INFO L714 BuchiCegarLoop]: Abstraction has 814 states and 1052 transitions. [2020-10-19 18:51:26,525 INFO L594 BuchiCegarLoop]: Abstraction has 814 states and 1052 transitions. [2020-10-19 18:51:26,525 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-19 18:51:26,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 814 states and 1052 transitions. [2020-10-19 18:51:26,531 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-19 18:51:26,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:26,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:26,533 INFO L852 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] [2020-10-19 18:51:26,533 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:51:26,533 INFO L794 eck$LassoCheckResult]: Stem: 21262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 21236#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; 21237#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 21207#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; 21208#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 21209#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; 21210#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 21211#L40-3 assume !(main_~i~1 < main_~n~0); 21205#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 21241#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 21288#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 21213#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 21273#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 21212#L24 assume ~n < 2; 21214#L8 assume true; 21612#merge_sortEXIT >#86#return; 21276#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 21277#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 21588#L24 assume ~n < 2; 21586#L8 assume true; 21584#merge_sortEXIT >#88#return; 21583#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 21581#L11-3 assume !!(merge_~k~0 < merge_~n); 21582#L12 assume !(merge_~j~0 == merge_~n); 21625#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); 21751#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; 21744#L14-2 merge_#t~ite14 := merge_#t~ite13; 21724#L13-2 merge_#t~ite15 := merge_#t~ite14; 21722#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 21611#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 21610#L11-3 assume !!(merge_~k~0 < merge_~n); 21298#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; 21299#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 21600#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 21293#L11-3 assume !(merge_~k~0 < merge_~n); 21263#L11-4 merge_~i~0 := 0; 21201#L17-3 [2020-10-19 18:51:26,533 INFO L796 eck$LassoCheckResult]: Loop: 21201#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; 21206#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 21201#L17-3 [2020-10-19 18:51:26,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:26,534 INFO L82 PathProgramCache]: Analyzing trace with hash 64206937, now seen corresponding path program 1 times [2020-10-19 18:51:26,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:26,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891953007] [2020-10-19 18:51:26,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,583 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:26,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2020-10-19 18:51:26,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:26,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413370917] [2020-10-19 18:51:26,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,593 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1573325915, now seen corresponding path program 1 times [2020-10-19 18:51:26,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:26,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951635734] [2020-10-19 18:51:26,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,649 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:27,928 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 234 DAG size of output: 193 [2020-10-19 18:51:28,101 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-19 18:51:28,354 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2020-10-19 18:51:28,617 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-19 18:51:28,753 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-19 18:51:29,462 WARN L193 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 147 [2020-10-19 18:51:29,737 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-19 18:51:29,745 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:51:29,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:51:29,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:51:29,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:51:29,745 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:51:29,746 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:29,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:51:29,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:51:29,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration17_Lasso [2020-10-19 18:51:29,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:51:29,746 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:51:29,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:29,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,432 WARN L193 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 124 [2020-10-19 18:51:30,565 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2020-10-19 18:51:30,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:30,917 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2020-10-19 18:51:31,569 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-10-19 18:51:31,665 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:51:31,665 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:31,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:31,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:31,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:31,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:31,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:31,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:31,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:31,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:31,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:31,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:31,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 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 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:32,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:32,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:32,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:32,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:32,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 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 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:32,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:32,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:32,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:32,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:32,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:32,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:32,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:32,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:32,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:32,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:32,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:32,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 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 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:32,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:32,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:32,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:32,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:32,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:32,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 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 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:32,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:32,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 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 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:32,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:32,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:32,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:32,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:32,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:32,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:32,366 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:51:32,429 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2020-10-19 18:51:32,430 INFO L444 ModelExtractionUtils]: 34 out of 67 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 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 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:32,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:51:32,434 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 18:51:32,435 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:51:32,435 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0) = -2*merge_sort_merge_~i~0 + 3 Supporting invariants [-1*merge_sort_merge_~n + 2 >= 0] [2020-10-19 18:51:32,516 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2020-10-19 18:51:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:32,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-19 18:51:32,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:32,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:51:32,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:32,761 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2020-10-19 18:51:32,761 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 814 states and 1052 transitions. cyclomatic complexity: 285 Second operand 11 states. [2020-10-19 18:51:33,283 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 814 states and 1052 transitions. cyclomatic complexity: 285. Second operand 11 states. Result 904 states and 1169 transitions. Complement of second has 19 states. [2020-10-19 18:51:33,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-19 18:51:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-19 18:51:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-10-19 18:51:33,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 36 letters. Loop has 2 letters. [2020-10-19 18:51:33,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:33,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 38 letters. Loop has 2 letters. [2020-10-19 18:51:33,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 36 letters. Loop has 4 letters. [2020-10-19 18:51:33,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:33,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 904 states and 1169 transitions. [2020-10-19 18:51:33,297 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-19 18:51:33,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 904 states to 820 states and 1062 transitions. [2020-10-19 18:51:33,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 487 [2020-10-19 18:51:33,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2020-10-19 18:51:33,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 820 states and 1062 transitions. [2020-10-19 18:51:33,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:33,308 INFO L691 BuchiCegarLoop]: Abstraction has 820 states and 1062 transitions. [2020-10-19 18:51:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states and 1062 transitions. [2020-10-19 18:51:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 801. [2020-10-19 18:51:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-10-19 18:51:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1038 transitions. [2020-10-19 18:51:33,335 INFO L714 BuchiCegarLoop]: Abstraction has 801 states and 1038 transitions. [2020-10-19 18:51:33,335 INFO L594 BuchiCegarLoop]: Abstraction has 801 states and 1038 transitions. [2020-10-19 18:51:33,335 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-19 18:51:33,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 1038 transitions. [2020-10-19 18:51:33,340 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-19 18:51:33,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:33,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:33,341 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:33,341 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:51:33,342 INFO L794 eck$LassoCheckResult]: Stem: 23210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 23185#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; 23186#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 23164#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; 23165#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 23166#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; 23167#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 23168#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; 23227#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 23226#L40-3 assume !(main_~i~1 < main_~n~0); 23160#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 23244#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 23243#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 23218#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 23219#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 23338#L24 assume ~n < 2; 23337#L8 assume true; 23336#merge_sortEXIT >#86#return; 23170#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 23335#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 23169#L24 assume ~n < 2; 23171#L8 assume true; 23187#merge_sortEXIT >#88#return; 23188#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 23189#L11-3 assume !!(merge_~k~0 < merge_~n); 23212#L12 assume !(merge_~j~0 == merge_~n); 23198#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); 23934#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; 23932#L14-2 merge_#t~ite14 := merge_#t~ite13; 23933#L13-2 merge_#t~ite15 := merge_#t~ite14; 23944#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 23943#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 23942#L11-3 assume !!(merge_~k~0 < merge_~n); 23941#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; 23900#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 23928#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 23716#L11-3 assume !(merge_~k~0 < merge_~n); 23715#L11-4 merge_~i~0 := 0; 23159#L17-3 [2020-10-19 18:51:33,342 INFO L796 eck$LassoCheckResult]: Loop: 23159#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; 23161#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 23159#L17-3 [2020-10-19 18:51:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:33,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1607578857, now seen corresponding path program 2 times [2020-10-19 18:51:33,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:33,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933912174] [2020-10-19 18:51:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:33,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-19 18:51:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:33,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-10-19 18:51:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-19 18:51:33,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933912174] [2020-10-19 18:51:33,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160531817] [2020-10-19 18:51:33,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:33,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 18:51:33,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:51:33,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 18:51:33,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-19 18:51:33,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:33,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2020-10-19 18:51:33,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174413870] [2020-10-19 18:51:33,757 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:33,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:33,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2020-10-19 18:51:33,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:33,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166506428] [2020-10-19 18:51:33,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:33,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:33,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:33,765 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:33,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:33,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-19 18:51:33,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-10-19 18:51:33,814 INFO L87 Difference]: Start difference. First operand 801 states and 1038 transitions. cyclomatic complexity: 284 Second operand 17 states. [2020-10-19 18:51:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:34,336 INFO L93 Difference]: Finished difference Result 773 states and 995 transitions. [2020-10-19 18:51:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-19 18:51:34,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 773 states and 995 transitions. [2020-10-19 18:51:34,343 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 198 [2020-10-19 18:51:34,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 773 states to 769 states and 991 transitions. [2020-10-19 18:51:34,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 498 [2020-10-19 18:51:34,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2020-10-19 18:51:34,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 769 states and 991 transitions. [2020-10-19 18:51:34,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:34,352 INFO L691 BuchiCegarLoop]: Abstraction has 769 states and 991 transitions. [2020-10-19 18:51:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states and 991 transitions. [2020-10-19 18:51:34,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 731. [2020-10-19 18:51:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2020-10-19 18:51:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 945 transitions. [2020-10-19 18:51:34,368 INFO L714 BuchiCegarLoop]: Abstraction has 731 states and 945 transitions. [2020-10-19 18:51:34,368 INFO L594 BuchiCegarLoop]: Abstraction has 731 states and 945 transitions. [2020-10-19 18:51:34,369 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-19 18:51:34,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 731 states and 945 transitions. [2020-10-19 18:51:34,372 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-19 18:51:34,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:34,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:34,374 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:34,374 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:51:34,374 INFO L794 eck$LassoCheckResult]: Stem: 24944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 24917#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; 24918#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 24895#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; 24896#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 24897#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; 24898#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 24899#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; 24960#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 24959#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; 24958#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 24957#L40-3 assume !(main_~i~1 < main_~n~0); 24893#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 24924#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 24979#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 24976#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 24977#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 25048#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 25042#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 25043#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 25049#L24 assume ~n < 2; 25047#L8 assume true; 25041#merge_sortEXIT >#86#return; 25035#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 25038#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 25045#L24 assume ~n < 2; 25039#L8 assume true; 25034#merge_sortEXIT >#88#return; 25033#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 25031#L11-3 assume !!(merge_~k~0 < merge_~n); 25032#L12 assume !(merge_~j~0 == merge_~n); 25083#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); 25245#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; 25237#L14-2 merge_#t~ite14 := merge_#t~ite13; 25238#L13-2 merge_#t~ite15 := merge_#t~ite14; 25218#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 25219#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 25210#L11-3 assume !!(merge_~k~0 < merge_~n); 25211#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; 24994#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 24993#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 24992#L11-3 assume !(merge_~k~0 < merge_~n); 24991#L11-4 merge_~i~0 := 0; 24989#L17-3 [2020-10-19 18:51:34,374 INFO L796 eck$LassoCheckResult]: Loop: 24989#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; 24990#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 24989#L17-3 [2020-10-19 18:51:34,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:34,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1148372884, now seen corresponding path program 3 times [2020-10-19 18:51:34,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:34,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285658095] [2020-10-19 18:51:34,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:34,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:34,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:34,424 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:34,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:34,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 5 times [2020-10-19 18:51:34,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:34,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027187814] [2020-10-19 18:51:34,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:34,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:34,431 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:34,433 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:34,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:34,434 INFO L82 PathProgramCache]: Analyzing trace with hash -220251946, now seen corresponding path program 2 times [2020-10-19 18:51:34,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:34,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947447376] [2020-10-19 18:51:34,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:34,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:34,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:34,490 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:35,657 WARN L193 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 190 [2020-10-19 18:51:35,805 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-19 18:51:36,052 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-19 18:51:36,170 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-19 18:51:36,541 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-10-19 18:51:36,702 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-19 18:51:37,287 WARN L193 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 104 [2020-10-19 18:51:37,452 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-10-19 18:51:37,651 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-19 18:51:37,823 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-19 18:51:39,074 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 168 DAG size of output: 159 [2020-10-19 18:51:39,890 WARN L193 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 136 [2020-10-19 18:51:39,904 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:51:39,904 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:51:39,904 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:51:39,904 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:51:39,904 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:51:39,904 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:39,904 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:51:39,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:51:39,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration19_Lasso [2020-10-19 18:51:39,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:51:39,905 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:51:39,905 WARN L313 ript$VariableManager]: TermVariabe aux_mod_v_ULTIMATE.start_main_~n~0_53_37 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-19 18:51:39,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:39,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:40,832 WARN L193 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 132 [2020-10-19 18:51:40,989 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2020-10-19 18:51:40,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:40,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:40,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:40,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:41,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:41,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:41,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:51:41,377 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2020-10-19 18:51:41,797 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-19 18:51:42,111 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-10-19 18:51:42,251 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:51:42,251 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 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 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 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 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 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 132 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 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 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 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 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 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 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 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 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 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 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 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 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 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 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 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 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 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 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 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 142 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 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 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 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 144 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 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 145 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 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 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:42,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:42,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:42,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 147 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:42,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 148 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:42,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:42,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 149 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:42,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:42,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:42,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:42,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:42,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:42,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:42,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 150 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:42,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:42,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:43,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:43,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:43,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:43,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:43,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:43,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:43,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:43,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 151 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:43,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:43,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:43,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:43,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:43,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:43,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:43,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:43,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:43,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 152 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:43,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:43,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:43,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:43,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:43,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:43,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:43,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:43,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 153 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:43,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:43,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:51:43,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:43,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:43,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:43,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:43,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:43,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 154 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:43,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:51:43,269 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-19 18:51:43,269 INFO L444 ModelExtractionUtils]: 50 out of 70 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 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 155 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:43,271 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:51:43,273 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:51:43,273 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:51:43,273 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0, merge_sort_merge_~n) = -1*merge_sort_merge_~i~0 + 1*merge_sort_merge_~n Supporting invariants [] [2020-10-19 18:51:43,378 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2020-10-19 18:51:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:43,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:51:43,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:43,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:51:43,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:43,490 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 [2020-10-19 18:51:43,490 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 731 states and 945 transitions. cyclomatic complexity: 257 Second operand 4 states. [2020-10-19 18:51:43,557 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 731 states and 945 transitions. cyclomatic complexity: 257. Second operand 4 states. Result 762 states and 992 transitions. Complement of second has 9 states. [2020-10-19 18:51:43,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:51:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:51:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-10-19 18:51:43,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 43 letters. Loop has 2 letters. [2020-10-19 18:51:43,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:43,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 45 letters. Loop has 2 letters. [2020-10-19 18:51:43,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:43,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 43 letters. Loop has 4 letters. [2020-10-19 18:51:43,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:43,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 762 states and 992 transitions. [2020-10-19 18:51:43,565 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 168 [2020-10-19 18:51:43,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 762 states to 742 states and 962 transitions. [2020-10-19 18:51:43,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 456 [2020-10-19 18:51:43,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 461 [2020-10-19 18:51:43,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 742 states and 962 transitions. [2020-10-19 18:51:43,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:43,572 INFO L691 BuchiCegarLoop]: Abstraction has 742 states and 962 transitions. [2020-10-19 18:51:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states and 962 transitions. [2020-10-19 18:51:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 739. [2020-10-19 18:51:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-10-19 18:51:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 959 transitions. [2020-10-19 18:51:43,587 INFO L714 BuchiCegarLoop]: Abstraction has 739 states and 959 transitions. [2020-10-19 18:51:43,587 INFO L594 BuchiCegarLoop]: Abstraction has 739 states and 959 transitions. [2020-10-19 18:51:43,587 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-19 18:51:43,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 739 states and 959 transitions. [2020-10-19 18:51:43,590 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 168 [2020-10-19 18:51:43,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:43,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:43,591 INFO L852 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] [2020-10-19 18:51:43,592 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:43,592 INFO L794 eck$LassoCheckResult]: Stem: 26671#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 26645#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; 26646#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 26624#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; 26625#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 26626#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; 26627#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 26628#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; 26694#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 26693#L40-3 assume !(main_~i~1 < main_~n~0); 26616#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 26795#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 26794#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 26792#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 26793#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 26797#L24 assume ~n < 2; 26796#L8 assume true; 26791#merge_sortEXIT >#86#return; 26638#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 26788#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 26787#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 26785#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 26786#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 26790#L24 assume ~n < 2; 26789#L8 assume true; 26784#merge_sortEXIT >#86#return; 26767#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 26777#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 26799#L24 assume ~n < 2; 26766#L8 assume true; 26768#merge_sortEXIT >#88#return; 26752#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 26750#L11-3 assume !!(merge_~k~0 < merge_~n); 26751#L12 assume !(merge_~j~0 == merge_~n); 26662#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); 26657#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; 26658#L14-2 merge_#t~ite14 := merge_#t~ite13; 26643#L13-2 merge_#t~ite15 := merge_#t~ite14; 26644#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 26674#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 26675#L11-3 assume !!(merge_~k~0 < merge_~n); 27302#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; 26701#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 26702#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 26697#L11-3 assume !(merge_~k~0 < merge_~n); 26698#L11-4 merge_~i~0 := 0; 27179#L17-3 assume !(merge_~i~0 < merge_~n); 27173#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 27174#L8 assume true; 26669#merge_sortEXIT >#88#return; 26670#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 27261#L11-3 assume !!(merge_~k~0 < merge_~n); 27260#L12 assume !(merge_~j~0 == merge_~n); 27259#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); 27256#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; 27253#L14-2 merge_#t~ite14 := merge_#t~ite13; 27251#L13-2 merge_#t~ite15 := merge_#t~ite14; 27249#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 27247#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 27245#L11-3 assume !!(merge_~k~0 < merge_~n); 27244#L12 [2020-10-19 18:51:43,592 INFO L796 eck$LassoCheckResult]: Loop: 27244#L12 assume !(merge_~j~0 == merge_~n); 27258#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); 27254#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; 27255#L14-2 merge_#t~ite14 := merge_#t~ite13; 27266#L13-2 merge_#t~ite15 := merge_#t~ite14; 27234#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 27235#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 27243#L11-3 assume !!(merge_~k~0 < merge_~n); 27244#L12 [2020-10-19 18:51:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1719261906, now seen corresponding path program 1 times [2020-10-19 18:51:43,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:43,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248246940] [2020-10-19 18:51:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:43,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-19 18:51:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:43,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-10-19 18:51:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:43,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-19 18:51:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:43,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-19 18:51:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-10-19 18:51:43,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248246940] [2020-10-19 18:51:43,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31089596] [2020-10-19 18:51:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:43,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-19 18:51:43,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-19 18:51:43,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:43,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14] total 18 [2020-10-19 18:51:43,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074316305] [2020-10-19 18:51:43,986 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2020-10-19 18:51:43,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:43,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558417424] [2020-10-19 18:51:43,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:43,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:43,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:43,996 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:44,147 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2020-10-19 18:51:44,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:44,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-19 18:51:44,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-10-19 18:51:44,201 INFO L87 Difference]: Start difference. First operand 739 states and 959 transitions. cyclomatic complexity: 264 Second operand 18 states. [2020-10-19 18:51:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:45,149 INFO L93 Difference]: Finished difference Result 960 states and 1212 transitions. [2020-10-19 18:51:45,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-19 18:51:45,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 960 states and 1212 transitions. [2020-10-19 18:51:45,155 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 254 [2020-10-19 18:51:45,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 960 states to 960 states and 1212 transitions. [2020-10-19 18:51:45,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 634 [2020-10-19 18:51:45,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 634 [2020-10-19 18:51:45,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 960 states and 1212 transitions. [2020-10-19 18:51:45,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:45,164 INFO L691 BuchiCegarLoop]: Abstraction has 960 states and 1212 transitions. [2020-10-19 18:51:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states and 1212 transitions. [2020-10-19 18:51:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 745. [2020-10-19 18:51:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2020-10-19 18:51:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 960 transitions. [2020-10-19 18:51:45,179 INFO L714 BuchiCegarLoop]: Abstraction has 745 states and 960 transitions. [2020-10-19 18:51:45,179 INFO L594 BuchiCegarLoop]: Abstraction has 745 states and 960 transitions. [2020-10-19 18:51:45,179 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-19 18:51:45,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 745 states and 960 transitions. [2020-10-19 18:51:45,182 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 168 [2020-10-19 18:51:45,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:45,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:45,184 INFO L852 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] [2020-10-19 18:51:45,184 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:45,184 INFO L794 eck$LassoCheckResult]: Stem: 28645#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 28618#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; 28619#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 28595#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; 28596#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 28597#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; 28598#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 28599#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; 28665#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 28664#L40-3 assume !(main_~i~1 < main_~n~0); 28607#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 28685#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 28684#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 28655#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 28656#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 28836#L24 assume ~n < 2; 28835#L8 assume true; 28834#merge_sortEXIT >#86#return; 28592#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 28833#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 28832#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 28682#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 28683#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 28831#L24 assume ~n < 2; 28830#L8 assume true; 28681#merge_sortEXIT >#86#return; 28601#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 28652#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 28600#L24 assume ~n < 2; 28602#L8 assume true; 29105#merge_sortEXIT >#88#return; 29104#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 29100#L11-3 assume !!(merge_~k~0 < merge_~n); 29094#L12 assume !(merge_~j~0 == merge_~n); 28610#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); 28611#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; 28635#L14-2 merge_#t~ite14 := merge_#t~ite13; 28616#L13-2 merge_#t~ite15 := merge_#t~ite14; 28617#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 29182#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 28650#L11-3 assume !!(merge_~k~0 < merge_~n); 28651#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; 29044#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 29039#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 29037#L11-3 assume !(merge_~k~0 < merge_~n); 29034#L11-4 merge_~i~0 := 0; 29033#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; 28594#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 28591#L17-3 assume !(merge_~i~0 < merge_~n); 28593#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 28620#L8 assume true; 28621#merge_sortEXIT >#88#return; 28622#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 28623#L11-3 assume !!(merge_~k~0 < merge_~n); 29320#L12 assume !(merge_~j~0 == merge_~n); 29319#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); 29317#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; 29318#L14-2 merge_#t~ite14 := merge_#t~ite13; 29326#L13-2 merge_#t~ite15 := merge_#t~ite14; 29325#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 29324#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 28649#L11-3 assume !!(merge_~k~0 < merge_~n); 28636#L12 [2020-10-19 18:51:45,184 INFO L796 eck$LassoCheckResult]: Loop: 28636#L12 assume !(merge_~j~0 == merge_~n); 28606#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); 28608#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; 28633#L14-2 merge_#t~ite14 := merge_#t~ite13; 29329#L13-2 merge_#t~ite15 := merge_#t~ite14; 29328#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 29327#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 28922#L11-3 assume !!(merge_~k~0 < merge_~n); 28636#L12 [2020-10-19 18:51:45,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2004988308, now seen corresponding path program 1 times [2020-10-19 18:51:45,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:45,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655164478] [2020-10-19 18:51:45,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:45,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-19 18:51:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:45,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-10-19 18:51:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:45,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-19 18:51:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:45,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-19 18:51:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 31 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-19 18:51:45,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655164478] [2020-10-19 18:51:45,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078433203] [2020-10-19 18:51:45,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:45,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-19 18:51:45,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-19 18:51:45,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:45,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2020-10-19 18:51:45,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228511024] [2020-10-19 18:51:45,827 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2020-10-19 18:51:45,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:45,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761283480] [2020-10-19 18:51:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:45,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:45,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:45,842 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:46,063 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2020-10-19 18:51:46,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:46,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-19 18:51:46,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2020-10-19 18:51:46,132 INFO L87 Difference]: Start difference. First operand 745 states and 960 transitions. cyclomatic complexity: 259 Second operand 21 states. [2020-10-19 18:51:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:48,854 INFO L93 Difference]: Finished difference Result 2711 states and 3571 transitions. [2020-10-19 18:51:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-10-19 18:51:48,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2711 states and 3571 transitions. [2020-10-19 18:51:48,871 INFO L131 ngComponentsAnalysis]: Automaton has 87 accepting balls. 690 [2020-10-19 18:51:48,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2711 states to 2705 states and 3565 transitions. [2020-10-19 18:51:48,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1664 [2020-10-19 18:51:48,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1664 [2020-10-19 18:51:48,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2705 states and 3565 transitions. [2020-10-19 18:51:48,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:48,896 INFO L691 BuchiCegarLoop]: Abstraction has 2705 states and 3565 transitions. [2020-10-19 18:51:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states and 3565 transitions. [2020-10-19 18:51:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 1111. [2020-10-19 18:51:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2020-10-19 18:51:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1441 transitions. [2020-10-19 18:51:48,930 INFO L714 BuchiCegarLoop]: Abstraction has 1111 states and 1441 transitions. [2020-10-19 18:51:48,930 INFO L594 BuchiCegarLoop]: Abstraction has 1111 states and 1441 transitions. [2020-10-19 18:51:48,931 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-19 18:51:48,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1111 states and 1441 transitions. [2020-10-19 18:51:48,934 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 288 [2020-10-19 18:51:48,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:48,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:48,936 INFO L852 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] [2020-10-19 18:51:48,936 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:48,936 INFO L794 eck$LassoCheckResult]: Stem: 32448#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 32424#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; 32425#L35 assume !(main_~n~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 32404#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; 32405#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 32406#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; 32407#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 32408#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; 32471#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 32470#L40-3 assume !(main_~i~1 < main_~n~0); 32396#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 32504#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 32503#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 32447#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 32476#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 32748#L24 assume ~n < 2; 32746#L8 assume true; 32446#merge_sortEXIT >#86#return; 32418#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 32517#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 32508#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 32493#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 32538#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 32514#L24 assume ~n < 2; 32515#L8 assume true; 32492#merge_sortEXIT >#86#return; 32473#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 32472#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 32474#L24 assume ~n < 2; 33040#L8 assume true; 33035#merge_sortEXIT >#88#return; 33036#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 33073#L11-3 assume !!(merge_~k~0 < merge_~n); 33074#L12 assume !(merge_~j~0 == merge_~n); 33431#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); 33438#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; 33436#L14-2 merge_#t~ite14 := merge_#t~ite13; 33435#L13-2 merge_#t~ite15 := merge_#t~ite14; 33434#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 33433#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 33432#L11-3 assume !!(merge_~k~0 < merge_~n); 33430#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; 32942#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 32939#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 32936#L11-3 assume !(merge_~k~0 < merge_~n); 32933#L11-4 merge_~i~0 := 0; 32930#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; 32929#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 32926#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; 32909#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 32908#L17-3 assume !(merge_~i~0 < merge_~n); 32417#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 32419#L8 assume true; 32426#merge_sortEXIT >#88#return; 32427#L28 merge_#in~a.base, merge_#in~a.offset, merge_#in~n, merge_#in~m := ~a.base, ~a.offset, ~n, ~m~0;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset, merge_#t~ite15, merge_#t~post3, merge_#t~mem4, merge_#t~ite14, merge_#t~post5, merge_#t~mem6, merge_#t~mem7, merge_#t~mem8, merge_#t~ite13, merge_#t~post9, merge_#t~mem10, merge_#t~post11, merge_#t~mem12, merge_#t~post2, merge_#t~mem17, merge_#t~post16, merge_~a.base, merge_~a.offset, merge_~n, merge_~m, merge_~i~0, merge_~j~0, merge_~k~0, merge_~x~0.base, merge_~x~0.offset;merge_~a.base, merge_~a.offset := merge_#in~a.base, merge_#in~a.offset;merge_~n := merge_#in~n;merge_~m := merge_#in~m;havoc merge_~i~0;havoc merge_~j~0;havoc merge_~k~0;call merge_#t~malloc1.base, merge_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * merge_~n);merge_~x~0.base, merge_~x~0.offset := merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 32428#L11-3 assume !!(merge_~k~0 < merge_~n); 33475#L12 assume !(merge_~j~0 == merge_~n); 33474#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); 33472#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; 33473#L14-2 merge_#t~ite14 := merge_#t~ite13; 33468#L13-2 merge_#t~ite15 := merge_#t~ite14; 33469#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 33464#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 33465#L11-3 assume !!(merge_~k~0 < merge_~n); 33477#L12 [2020-10-19 18:51:48,936 INFO L796 eck$LassoCheckResult]: Loop: 33477#L12 assume !(merge_~j~0 == merge_~n); 32413#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); 32414#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; 32436#L14-2 merge_#t~ite14 := merge_#t~ite13; 33482#L13-2 merge_#t~ite15 := merge_#t~ite14; 33481#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~post11;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~post3;havoc merge_#t~mem12;havoc merge_#t~mem6;havoc merge_#t~mem4;havoc merge_#t~ite15;havoc merge_#t~mem8;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem10;havoc merge_#t~mem7; 33480#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 33479#L11-3 assume !!(merge_~k~0 < merge_~n); 33477#L12 [2020-10-19 18:51:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:48,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1710153686, now seen corresponding path program 2 times [2020-10-19 18:51:48,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:48,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457566645] [2020-10-19 18:51:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:48,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:49,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:49,032 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:49,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:49,033 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 4 times [2020-10-19 18:51:49,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:49,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546994380] [2020-10-19 18:51:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:49,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:49,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:49,044 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:49,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1618831734, now seen corresponding path program 3 times [2020-10-19 18:51:49,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:49,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420786715] [2020-10-19 18:51:49,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:49,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:49,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:49,139 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:49,291 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2020-10-19 18:51:52,529 WARN L193 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 285 DAG size of output: 223 [2020-10-19 18:51:52,999 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-19 18:51:53,542 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-10-19 18:51:54,165 WARN L193 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-19 18:51:59,103 WARN L193 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 286 DAG size of output: 246 [2020-10-19 18:52:01,417 WARN L193 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 153 [2020-10-19 18:52:01,738 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2020-10-19 18:52:02,770 WARN L193 SmtUtils]: Spent 948.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-10-19 18:52:03,820 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 153 [2020-10-19 18:52:06,920 WARN L193 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 209 DAG size of output: 196 [2020-10-19 18:52:08,163 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 173 [2020-10-19 18:52:08,167 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:52:08,167 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:52:08,167 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:52:08,168 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:52:08,168 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:52:08,168 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:52:08,168 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:52:08,168 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:52:08,168 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration22_Lasso [2020-10-19 18:52:08,168 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:52:08,169 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:52:08,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:52:08,923 FATAL L? ?]: 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.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.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:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) 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:957) 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:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) 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:320) 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) [2020-10-19 18:52:08,928 INFO L168 Benchmark]: Toolchain (without parser) took 82168.46 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 809.5 MB). Free memory was 958.6 MB in the beginning and 1.2 GB in the end (delta: -233.7 MB). Peak memory consumption was 864.3 MB. Max. memory is 11.5 GB. [2020-10-19 18:52:08,928 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:52:08,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 947.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:52:08,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2020-10-19 18:52:08,929 INFO L168 Benchmark]: Boogie Preprocessor took 29.02 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 18:52:08,930 INFO L168 Benchmark]: RCFGBuilder took 396.09 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2020-10-19 18:52:08,931 INFO L168 Benchmark]: BuchiAutomizer took 81351.53 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 665.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.5 MB). Peak memory consumption was 868.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:52:08,933 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 947.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.02 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 396.09 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 81351.53 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 665.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.5 MB). Peak memory consumption was 868.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.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...