./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-9a8b2e8 [2020-10-20 06:43:45,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:43:45,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:43:45,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:43:45,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:43:45,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:43:45,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:43:45,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:43:45,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:43:45,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:43:45,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:43:45,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:43:45,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:43:45,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:43:45,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:43:45,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:43:45,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:43:45,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:43:45,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:43:45,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:43:45,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:43:45,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:43:45,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:43:45,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:43:45,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:43:45,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:43:45,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:43:45,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:43:45,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:43:45,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:43:45,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:43:45,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:43:45,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:43:45,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:43:45,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:43:45,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:43:45,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:43:45,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:43:45,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:43:45,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:43:45,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:43:45,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:43:45,187 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:43:45,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:43:45,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:43:45,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:43:45,189 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:43:45,192 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:43:45,192 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:43:45,192 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:43:45,192 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:43:45,192 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:43:45,193 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:43:45,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:43:45,194 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:43:45,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:43:45,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:43:45,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:43:45,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:43:45,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:43:45,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:43:45,196 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:43:45,196 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:43:45,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:43:45,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:43:45,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:43:45,197 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:43:45,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:43:45,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:43:45,198 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:43:45,198 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:43:45,199 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:43:45,199 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-20 06:43:45,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:43:45,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:43:45,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:43:45,416 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:43:45,416 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:43:45,417 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-20 06:43:45,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5071e8e/f395a3a37ba34f69b7ecab8621ecf58b/FLAG7c252a818 [2020-10-20 06:43:46,003 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:43:46,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2020-10-20 06:43:46,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5071e8e/f395a3a37ba34f69b7ecab8621ecf58b/FLAG7c252a818 [2020-10-20 06:43:46,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5071e8e/f395a3a37ba34f69b7ecab8621ecf58b [2020-10-20 06:43:46,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:43:46,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:43:46,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:43:46,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:43:46,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:43:46,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a16a614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46, skipping insertion in model container [2020-10-20 06:43:46,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:43:46,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:43:46,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:43:46,567 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:43:46,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:43:46,608 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:43:46,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46 WrapperNode [2020-10-20 06:43:46,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:43:46,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:43:46,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:43:46,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:43:46,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:43:46,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:43:46,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:43:46,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:43:46,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (1/1) ... [2020-10-20 06:43:46,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:43:46,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:43:46,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:43:46,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:43:46,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (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-20 06:43:46,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:43:46,754 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2020-10-20 06:43:46,754 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2020-10-20 06:43:46,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 06:43:46,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:43:46,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:43:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:43:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:43:47,112 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:43:47,113 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-20 06:43:47,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:43:47 BoogieIcfgContainer [2020-10-20 06:43:47,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:43:47,115 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:43:47,115 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:43:47,118 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:43:47,119 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:47,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:43:46" (1/3) ... [2020-10-20 06:43:47,120 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3566899a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:43:47, skipping insertion in model container [2020-10-20 06:43:47,120 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:47,121 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:43:46" (2/3) ... [2020-10-20 06:43:47,121 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3566899a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:43:47, skipping insertion in model container [2020-10-20 06:43:47,121 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:43:47,121 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:43:47" (3/3) ... [2020-10-20 06:43:47,123 INFO L373 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2020-10-20 06:43:47,169 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:43:47,169 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:43:47,169 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:43:47,169 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:43:47,169 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:43:47,169 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:43:47,169 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:43:47,170 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:43:47,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2020-10-20 06:43:47,207 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-10-20 06:43:47,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:47,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:47,214 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:43:47,214 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:43:47,214 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:43:47,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2020-10-20 06:43:47,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-10-20 06:43:47,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:47,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:47,218 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:43:47,218 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:43:47,224 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-20 06:43:47,225 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-20 06:43:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:47,231 INFO L82 PathProgramCache]: Analyzing trace with hash 88447, now seen corresponding path program 1 times [2020-10-20 06:43:47,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:47,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492337371] [2020-10-20 06:43:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:47,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:47,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:47,364 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2020-10-20 06:43:47,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:47,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721478466] [2020-10-20 06:43:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:47,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:47,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:47,386 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:47,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:47,388 INFO L82 PathProgramCache]: Analyzing trace with hash 84999937, now seen corresponding path program 1 times [2020-10-20 06:43:47,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:47,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163083566] [2020-10-20 06:43:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:47,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:47,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:47,428 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:47,627 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:47,628 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:47,628 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:47,628 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:47,629 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:47,629 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:47,629 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:47,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:47,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2020-10-20 06:43:47,630 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:47,630 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:47,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:47,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:47,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:47,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:47,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:47,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:48,067 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:43:48,073 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-20 06:43:48,087 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-20 06:43:48,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:48,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:48,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:48,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:48,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:48,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:48,095 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-20 06:43:48,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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:43:48,144 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-20 06:43:48,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:48,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:48,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:48,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:48,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:48,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:48,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:48,153 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) [2020-10-20 06:43:48,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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:48,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:48,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:48,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:48,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:48,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:48,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:48,209 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-20 06:43:48,251 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-20 06:43:48,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:48,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:48,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:48,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:48,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:48,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:48,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:48,257 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-20 06:43:48,304 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-20 06:43:48,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:48,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:48,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:48,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:48,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:48,316 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-20 06:43:48,326 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-20 06:43:48,371 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-20 06:43:48,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:48,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:48,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:48,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:48,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:48,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:48,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:48,378 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-20 06:43:48,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-20 06:43:48,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:48,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:48,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:48,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:48,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:48,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:48,483 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:43:48,618 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 06:43:48,618 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-20 06:43:48,624 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-20 06:43:48,633 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:43:48,633 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:43:48,634 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-20 06:43:48,666 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-20 06:43:48,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:43:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:48,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:43:48,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:48,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:43:48,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:48,743 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-20 06:43:48,760 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-20 06:43:48,762 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 3 states. [2020-10-20 06:43:48,819 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-20 06:43:48,820 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-20 06:43:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:43:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-10-20 06:43:48,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 2 letters. [2020-10-20 06:43:48,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:48,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-20 06:43:48,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:48,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-20 06:43:48,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:48,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2020-10-20 06:43:48,834 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-20 06:43:48,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 26 states and 37 transitions. [2020-10-20 06:43:48,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 06:43:48,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 06:43:48,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2020-10-20 06:43:48,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:43:48,846 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-10-20 06:43:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2020-10-20 06:43:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-10-20 06:43:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-20 06:43:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2020-10-20 06:43:48,875 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-10-20 06:43:48,875 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-10-20 06:43:48,875 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:43:48,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2020-10-20 06:43:48,877 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-20 06:43:48,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:48,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:48,878 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:43:48,878 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:43:48,878 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-20 06:43:48,878 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-20 06:43:48,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash 84999888, now seen corresponding path program 1 times [2020-10-20 06:43:48,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:48,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065501423] [2020-10-20 06:43:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:49,007 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-20 06:43:49,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065501423] [2020-10-20 06:43:49,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:43:49,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:43:49,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722042461] [2020-10-20 06:43:49,012 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:43:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2020-10-20 06:43:49,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:49,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996918591] [2020-10-20 06:43:49,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,043 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,045 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:49,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:49,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:43:49,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:43:49,194 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-10-20 06:43:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:49,229 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-10-20 06:43:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:43:49,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2020-10-20 06:43:49,232 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-20 06:43:49,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2020-10-20 06:43:49,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 06:43:49,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 06:43:49,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-10-20 06:43:49,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:43:49,235 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-20 06:43:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-10-20 06:43:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-10-20 06:43:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-20 06:43:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-10-20 06:43:49,239 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-10-20 06:43:49,239 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-10-20 06:43:49,239 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:43:49,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2020-10-20 06:43:49,240 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-20 06:43:49,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:49,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:49,241 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:49,242 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:43:49,242 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-20 06:43:49,242 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-20 06:43:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash 80563154, now seen corresponding path program 1 times [2020-10-20 06:43:49,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:49,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505897056] [2020-10-20 06:43:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,258 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,274 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:49,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:49,275 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 2 times [2020-10-20 06:43:49,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:49,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966458988] [2020-10-20 06:43:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,297 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:49,299 INFO L82 PathProgramCache]: Analyzing trace with hash -829797441, now seen corresponding path program 1 times [2020-10-20 06:43:49,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:49,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412967825] [2020-10-20 06:43:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:49,396 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-20 06:43:49,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412967825] [2020-10-20 06:43:49,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349453016] [2020-10-20 06:43:49,397 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-20 06:43:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:49,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:43:49,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:49,487 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-20 06:43:49,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:43:49,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 06:43:49,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154392682] [2020-10-20 06:43:49,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:49,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:43:49,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:43:49,653 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-10-20 06:43:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:49,733 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-10-20 06:43:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:43:49,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2020-10-20 06:43:49,741 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-20 06:43:49,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2020-10-20 06:43:49,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-20 06:43:49,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-20 06:43:49,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2020-10-20 06:43:49,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:43:49,748 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-10-20 06:43:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2020-10-20 06:43:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-10-20 06:43:49,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 06:43:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-10-20 06:43:49,755 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-10-20 06:43:49,756 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-10-20 06:43:49,756 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:43:49,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-10-20 06:43:49,758 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-20 06:43:49,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:49,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:49,759 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-20 06:43:49,759 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:43:49,760 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-20 06:43:49,760 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-20 06:43:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:49,760 INFO L82 PathProgramCache]: Analyzing trace with hash 111829076, now seen corresponding path program 2 times [2020-10-20 06:43:49,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:49,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960016172] [2020-10-20 06:43:49,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,820 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:49,821 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 3 times [2020-10-20 06:43:49,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:49,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212557400] [2020-10-20 06:43:49,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,838 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1394618371, now seen corresponding path program 2 times [2020-10-20 06:43:49,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:49,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159425106] [2020-10-20 06:43:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:49,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:49,894 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:50,253 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2020-10-20 06:43:50,471 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:50,471 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:50,472 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:50,472 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:50,472 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:50,472 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:50,472 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:50,472 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:50,472 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2020-10-20 06:43:50,472 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:50,472 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:50,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,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-20 06:43:50,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,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-20 06:43:50,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-20 06:43:50,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-20 06:43:50,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-20 06:43:50,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-20 06:43:50,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,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-20 06:43:50,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:50,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:51,006 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:43:51,007 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) [2020-10-20 06:43:51,017 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-20 06:43:51,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:51,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:51,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:51,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:51,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:51,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:51,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:51,022 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-20 06:43:51,053 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-20 06:43:51,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:51,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:51,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:51,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:51,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:51,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:51,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:51,062 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-20 06:43:51,084 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-20 06:43:51,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:51,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:51,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:51,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:51,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:51,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:51,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:51,087 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-20 06:43:51,111 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-20 06:43:51,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:51,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:51,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:51,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:51,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:51,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:51,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:51,115 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-20 06:43:51,149 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-20 06:43:51,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:51,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:51,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:51,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:51,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:51,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:51,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:51,154 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-20 06:43:51,177 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-20 06:43:51,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:51,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:51,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:51,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:51,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:51,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:51,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:51,184 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-20 06:43:51,222 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-20 06:43:51,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:51,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:51,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:51,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:51,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:51,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:51,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:51,232 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-20 06:43:51,284 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-20 06:43:51,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:51,285 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-20 06:43:51,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:51,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:51,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:51,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:51,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:51,288 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-20 06:43:51,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-20 06:43:51,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:51,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:51,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:51,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:51,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:51,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:51,354 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:43:51,381 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-20 06:43:51,381 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-20 06:43:51,394 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:43:51,397 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:43:51,397 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:43:51,397 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2020-10-20 06:43:51,425 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-10-20 06:43:51,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:51,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:43:51,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:51,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:43:51,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:51,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:43:51,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:43:51,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:43:51,595 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-20 06:43:51,595 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-20 06:43:51,595 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-10-20 06:43:51,662 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-20 06:43:51,665 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-20 06:43:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:43:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-20 06:43:51,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2020-10-20 06:43:51,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:51,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2020-10-20 06:43:51,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:51,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2020-10-20 06:43:51,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:51,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2020-10-20 06:43:51,682 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-20 06:43:51,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 49 transitions. [2020-10-20 06:43:51,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-20 06:43:51,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-20 06:43:51,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2020-10-20 06:43:51,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:43:51,701 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2020-10-20 06:43:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2020-10-20 06:43:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-10-20 06:43:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 06:43:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-10-20 06:43:51,711 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 06:43:51,711 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 06:43:51,711 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:43:51,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-10-20 06:43:51,712 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-10-20 06:43:51,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:51,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:51,714 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:51,714 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:51,714 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-20 06:43:51,714 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-20 06:43:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744228, now seen corresponding path program 1 times [2020-10-20 06:43:51,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:51,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447956714] [2020-10-20 06:43:51,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:51,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:51,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:51,747 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:51,748 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 1 times [2020-10-20 06:43:51,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:51,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810704000] [2020-10-20 06:43:51,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:51,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:51,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:51,771 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:51,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:51,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1064649429, now seen corresponding path program 1 times [2020-10-20 06:43:51,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:51,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170190925] [2020-10-20 06:43:51,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:51,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-20 06:43:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:51,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-20 06:43:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:51,960 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-20 06:43:51,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170190925] [2020-10-20 06:43:51,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033017851] [2020-10-20 06:43:51,961 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-20 06:43:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:52,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:43:52,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:52,116 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-20 06:43:52,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:43:52,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2020-10-20 06:43:52,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943287731] [2020-10-20 06:43:52,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:52,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 06:43:52,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-10-20 06:43:52,377 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 14 states. [2020-10-20 06:43:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:52,749 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2020-10-20 06:43:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 06:43:52,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 89 transitions. [2020-10-20 06:43:52,754 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2020-10-20 06:43:52,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 67 states and 85 transitions. [2020-10-20 06:43:52,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-10-20 06:43:52,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 06:43:52,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 85 transitions. [2020-10-20 06:43:52,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:43:52,757 INFO L691 BuchiCegarLoop]: Abstraction has 67 states and 85 transitions. [2020-10-20 06:43:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 85 transitions. [2020-10-20 06:43:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2020-10-20 06:43:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 06:43:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2020-10-20 06:43:52,765 INFO L714 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2020-10-20 06:43:52,765 INFO L594 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2020-10-20 06:43:52,765 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:43:52,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2020-10-20 06:43:52,766 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2020-10-20 06:43:52,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:52,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:52,767 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:52,767 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:52,768 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-20 06:43:52,768 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-20 06:43:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 2 times [2020-10-20 06:43:52,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:52,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334511612] [2020-10-20 06:43:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:52,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:52,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:52,796 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:52,796 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 2 times [2020-10-20 06:43:52,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:52,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111242003] [2020-10-20 06:43:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:52,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:52,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:52,809 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:52,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:52,810 INFO L82 PathProgramCache]: Analyzing trace with hash -889748845, now seen corresponding path program 2 times [2020-10-20 06:43:52,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:52,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219809731] [2020-10-20 06:43:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:52,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:52,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:52,856 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:53,547 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2020-10-20 06:43:53,867 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2020-10-20 06:43:53,934 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:53,934 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:53,934 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:53,934 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:53,934 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:53,934 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:53,935 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:53,935 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:53,935 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso [2020-10-20 06:43:53,935 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:53,935 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:53,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-20 06:43:53,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,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-20 06:43:53,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,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-20 06:43:53,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,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-20 06:43:53,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,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-20 06:43:53,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-20 06:43:53,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-20 06:43:53,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,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-20 06:43:53,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,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-20 06:43:53,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-20 06:43:53,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:53,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,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-20 06:43:54,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-20 06:43:54,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-20 06:43:54,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-20 06:43:54,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-20 06:43:54,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-20 06:43:54,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,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-20 06:43:54,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-20 06:43:54,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-20 06:43:54,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-20 06:43:54,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-20 06:43:54,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,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-20 06:43:54,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-20 06:43:54,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:54,554 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:43:54,555 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:54,568 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-20 06:43:54,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,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 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-20 06:43:54,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-20 06:43:54,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,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 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-20 06:43:54,625 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-20 06:43:54,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,641 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-20 06:43:54,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-20 06:43:54,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,666 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-20 06:43:54,689 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-20 06:43:54,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:54,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:54,696 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) [2020-10-20 06:43:54,732 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-20 06:43:54,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:54,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) [2020-10-20 06:43:54,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 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:54,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,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 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-20 06:43:54,802 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-20 06:43:54,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,806 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-20 06:43:54,830 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-20 06:43:54,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,833 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) [2020-10-20 06:43:54,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-20 06:43:54,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:54,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,866 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-20 06:43:54,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-20 06:43:54,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,891 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-20 06:43:54,910 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-20 06:43:54,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,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 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-20 06:43:54,936 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-20 06:43:54,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:54,939 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-20 06:43:54,971 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-20 06:43:54,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:54,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:54,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:54,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:54,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:54,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:54,974 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-20 06:43:54,980 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-20 06:43:55,003 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-20 06:43:55,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:55,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:55,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:55,007 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-20 06:43:55,029 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-20 06:43:55,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:55,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:55,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:55,033 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-20 06:43:55,055 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-20 06:43:55,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:55,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:55,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:55,059 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) [2020-10-20 06:43:55,100 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-20 06:43:55,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:55,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:55,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:55,104 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-20 06:43:55,125 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-20 06:43:55,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:55,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:55,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:55,129 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-20 06:43:55,161 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-20 06:43:55,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:55,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:55,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:55,165 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-20 06:43:55,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-20 06:43:55,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:55,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:55,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:55,191 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-20 06:43:55,213 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-20 06:43:55,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:55,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:55,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:55,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 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-20 06:43:55,239 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-20 06:43:55,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:43:55,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:43:55,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:43:55,242 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-20 06:43:55,263 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-20 06:43:55,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:55,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:55,270 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-20 06:43:55,302 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-20 06:43:55,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,303 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 06:43:55,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,307 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 06:43:55,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:55,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 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-20 06:43:55,343 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-20 06:43:55,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:55,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:55,352 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-20 06:43:55,374 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-20 06:43:55,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:55,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:55,387 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) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:55,408 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-20 06:43:55,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:43:55,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:43:55,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:43:55,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:43:55,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:43:55,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:43:55,437 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:43:55,481 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 06:43:55,481 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) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:55,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:43:55,486 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-10-20 06:43:55,486 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:43:55,486 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [-6*merge_sort_~n + 6*merge_sort_~m~0 + 5*merge_sort_#in~n >= 0, 5*merge_sort_#in~n - 1 >= 0] [2020-10-20 06:43:55,511 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2020-10-20 06:43:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:55,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 06:43:55,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:55,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:43:55,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:43:56,030 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-20 06:43:56,031 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-20 06:43:56,031 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23 Second operand 14 states. [2020-10-20 06:43:56,714 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-20 06:43:56,715 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-20 06:43:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-20 06:43:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2020-10-20 06:43:56,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 18 letters. Loop has 8 letters. [2020-10-20 06:43:56,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:56,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 26 letters. Loop has 8 letters. [2020-10-20 06:43:56,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:56,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 18 letters. Loop has 16 letters. [2020-10-20 06:43:56,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:43:56,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 436 transitions. [2020-10-20 06:43:56,727 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2020-10-20 06:43:56,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 240 states and 334 transitions. [2020-10-20 06:43:56,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2020-10-20 06:43:56,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 176 [2020-10-20 06:43:56,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 334 transitions. [2020-10-20 06:43:56,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:43:56,735 INFO L691 BuchiCegarLoop]: Abstraction has 240 states and 334 transitions. [2020-10-20 06:43:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 334 transitions. [2020-10-20 06:43:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 214. [2020-10-20 06:43:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-20 06:43:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 288 transitions. [2020-10-20 06:43:56,758 INFO L714 BuchiCegarLoop]: Abstraction has 214 states and 288 transitions. [2020-10-20 06:43:56,758 INFO L594 BuchiCegarLoop]: Abstraction has 214 states and 288 transitions. [2020-10-20 06:43:56,758 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:43:56,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 288 transitions. [2020-10-20 06:43:56,761 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2020-10-20 06:43:56,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:56,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:56,762 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:56,762 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:43:56,762 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-20 06:43:56,762 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:43:56,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:56,763 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 1 times [2020-10-20 06:43:56,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:56,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404104727] [2020-10-20 06:43:56,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:56,777 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:56,789 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:56,795 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2020-10-20 06:43:56,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:56,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245714183] [2020-10-20 06:43:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:56,799 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:56,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:56,804 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:56,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:56,804 INFO L82 PathProgramCache]: Analyzing trace with hash -782974256, now seen corresponding path program 1 times [2020-10-20 06:43:56,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:56,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947807424] [2020-10-20 06:43:56,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:56,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-20 06:43:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:56,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-20 06:43:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:43:56,931 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-20 06:43:56,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947807424] [2020-10-20 06:43:56,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:43:56,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 06:43:56,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310928784] [2020-10-20 06:43:57,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:43:57,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:43:57,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:43:57,005 INFO L87 Difference]: Start difference. First operand 214 states and 288 transitions. cyclomatic complexity: 98 Second operand 5 states. [2020-10-20 06:43:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:43:57,137 INFO L93 Difference]: Finished difference Result 346 states and 486 transitions. [2020-10-20 06:43:57,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:43:57,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 346 states and 486 transitions. [2020-10-20 06:43:57,144 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 136 [2020-10-20 06:43:57,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 346 states to 346 states and 486 transitions. [2020-10-20 06:43:57,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2020-10-20 06:43:57,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2020-10-20 06:43:57,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 346 states and 486 transitions. [2020-10-20 06:43:57,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:43:57,155 INFO L691 BuchiCegarLoop]: Abstraction has 346 states and 486 transitions. [2020-10-20 06:43:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states and 486 transitions. [2020-10-20 06:43:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 268. [2020-10-20 06:43:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-10-20 06:43:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 351 transitions. [2020-10-20 06:43:57,180 INFO L714 BuchiCegarLoop]: Abstraction has 268 states and 351 transitions. [2020-10-20 06:43:57,180 INFO L594 BuchiCegarLoop]: Abstraction has 268 states and 351 transitions. [2020-10-20 06:43:57,180 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:43:57,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 268 states and 351 transitions. [2020-10-20 06:43:57,182 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2020-10-20 06:43:57,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:43:57,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:43:57,183 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:57,184 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:43:57,184 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-20 06:43:57,184 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:43:57,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:57,184 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 2 times [2020-10-20 06:43:57,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:57,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85614658] [2020-10-20 06:43:57,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:57,196 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:57,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:57,222 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2020-10-20 06:43:57,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:57,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383078829] [2020-10-20 06:43:57,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:57,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:57,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:57,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:57,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:43:57,244 INFO L82 PathProgramCache]: Analyzing trace with hash 389830265, now seen corresponding path program 1 times [2020-10-20 06:43:57,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:43:57,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879582844] [2020-10-20 06:43:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:43:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:57,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:43:57,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:43:57,308 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:43:57,462 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2020-10-20 06:43:57,982 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 125 [2020-10-20 06:43:58,128 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2020-10-20 06:43:58,319 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-10-20 06:43:58,913 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 121 [2020-10-20 06:43:59,065 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-20 06:43:59,071 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:43:59,071 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:43:59,072 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:43:59,072 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:43:59,072 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:43:59,072 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:43:59,072 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:43:59,072 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:43:59,072 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso [2020-10-20 06:43:59,072 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:43:59,073 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:43:59,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,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-20 06:43:59,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,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-20 06:43:59,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-20 06:43:59,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-20 06:43:59,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,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-20 06:43:59,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-20 06:43:59,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-20 06:43:59,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,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-20 06:43:59,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,558 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2020-10-20 06:43:59,710 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2020-10-20 06:43:59,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:43:59,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:00,320 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2020-10-20 06:44:00,689 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-10-20 06:44:00,868 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-20 06:44:01,115 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-20 06:44:01,131 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:44:01,131 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-20 06:44:01,141 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-20 06:44:01,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,144 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) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:01,166 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-20 06:44:01,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,169 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) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:01,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-20 06:44:01,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,196 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-20 06:44:01,221 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-20 06:44:01,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,224 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-20 06:44:01,247 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-20 06:44:01,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,250 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-20 06:44:01,271 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-20 06:44:01,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:01,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:01,276 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-20 06:44:01,299 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-20 06:44:01,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,302 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) [2020-10-20 06:44:01,325 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-20 06:44:01,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:01,331 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-20 06:44:01,353 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-20 06:44:01,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,357 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-20 06:44:01,380 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-20 06:44:01,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,383 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-20 06:44:01,404 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-20 06:44:01,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,407 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-20 06:44:01,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-20 06:44:01,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,435 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-20 06:44:01,457 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-20 06:44:01,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:01,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:01,463 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-20 06:44:01,484 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-20 06:44:01,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,487 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-20 06:44:01,509 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-20 06:44:01,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,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 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-20 06:44:01,533 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-20 06:44:01,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,536 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-20 06:44:01,557 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-20 06:44:01,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,561 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-20 06:44:01,589 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-20 06:44:01,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,592 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-20 06:44:01,612 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-20 06:44:01,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,615 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-20 06:44:01,637 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-20 06:44:01,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,641 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-20 06:44:01,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-20 06:44:01,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,674 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-20 06:44:01,702 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-20 06:44:01,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,705 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-20 06:44:01,725 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-20 06:44:01,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:01,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:01,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:01,728 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-20 06:44:01,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-20 06:44:01,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:01,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:01,759 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-20 06:44:01,780 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-20 06:44:01,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:01,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:01,786 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-20 06:44:01,808 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-20 06:44:01,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,809 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-10-20 06:44:01,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,816 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-20 06:44:01,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:01,831 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-20 06:44:01,851 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-20 06:44:01,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:01,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:01,857 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-20 06:44:01,879 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-20 06:44:01,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:01,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:01,888 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-20 06:44:01,910 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-20 06:44:01,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:01,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:01,918 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-20 06:44:01,941 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-20 06:44:01,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:01,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:01,948 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-20 06:44:01,969 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-20 06:44:01,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:01,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:01,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:01,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:01,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:01,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:01,980 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-20 06:44:02,003 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-20 06:44:02,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:02,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:02,005 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-10-20 06:44:02,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:02,098 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2020-10-20 06:44:02,099 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2020-10-20 06:44:02,824 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:44:05,240 INFO L443 ModelExtractionUtils]: Simplification made 67 calls to the SMT solver. [2020-10-20 06:44:05,241 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) Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:05,242 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:44:05,253 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2020-10-20 06:44:05,253 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:44:05,253 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, merge_sort_merge_~i~0, v_rep(select #length merge_sort_merge_~a.base)_1) = -1*merge_sort_merge_~a.offset - 4*merge_sort_merge_~i~0 + 1*v_rep(select #length merge_sort_merge_~a.base)_1 Supporting invariants [] [2020-10-20 06:44:05,321 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 06:44:05,323 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:44:05,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:05,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:44:05,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:05,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:44:05,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:05,447 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-20 06:44:05,447 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-20 06:44:05,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 268 states and 351 transitions. cyclomatic complexity: 107 Second operand 6 states. [2020-10-20 06:44:05,574 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-20 06:44:05,575 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-20 06:44:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:44:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-10-20 06:44:05,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 22 letters. Loop has 8 letters. [2020-10-20 06:44:05,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:05,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 30 letters. Loop has 8 letters. [2020-10-20 06:44:05,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:05,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 22 letters. Loop has 16 letters. [2020-10-20 06:44:05,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:05,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 724 states and 975 transitions. [2020-10-20 06:44:05,594 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 208 [2020-10-20 06:44:05,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 724 states to 706 states and 939 transitions. [2020-10-20 06:44:05,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2020-10-20 06:44:05,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2020-10-20 06:44:05,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 706 states and 939 transitions. [2020-10-20 06:44:05,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:05,609 INFO L691 BuchiCegarLoop]: Abstraction has 706 states and 939 transitions. [2020-10-20 06:44:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states and 939 transitions. [2020-10-20 06:44:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 515. [2020-10-20 06:44:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-10-20 06:44:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 703 transitions. [2020-10-20 06:44:05,666 INFO L714 BuchiCegarLoop]: Abstraction has 515 states and 703 transitions. [2020-10-20 06:44:05,666 INFO L594 BuchiCegarLoop]: Abstraction has 515 states and 703 transitions. [2020-10-20 06:44:05,666 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:44:05,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 515 states and 703 transitions. [2020-10-20 06:44:05,670 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 166 [2020-10-20 06:44:05,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:05,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:05,672 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-20 06:44:05,673 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:44:05,673 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-20 06:44:05,673 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:05,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:05,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 1 times [2020-10-20 06:44:05,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:05,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430367016] [2020-10-20 06:44:05,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:05,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:05,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:05,722 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1482376367, now seen corresponding path program 1 times [2020-10-20 06:44:05,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:05,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218101908] [2020-10-20 06:44:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:05,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:05,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:05,742 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:05,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:05,744 INFO L82 PathProgramCache]: Analyzing trace with hash 426493234, now seen corresponding path program 1 times [2020-10-20 06:44:05,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:05,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574656655] [2020-10-20 06:44:05,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:05,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-20 06:44:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:05,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-20 06:44:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:05,812 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-20 06:44:05,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574656655] [2020-10-20 06:44:05,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:44:05,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 06:44:05,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520582803] [2020-10-20 06:44:05,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:44:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:44:05,884 INFO L87 Difference]: Start difference. First operand 515 states and 703 transitions. cyclomatic complexity: 232 Second operand 5 states. [2020-10-20 06:44:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:05,962 INFO L93 Difference]: Finished difference Result 726 states and 976 transitions. [2020-10-20 06:44:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:44:05,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 726 states and 976 transitions. [2020-10-20 06:44:05,972 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 246 [2020-10-20 06:44:05,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 726 states to 726 states and 976 transitions. [2020-10-20 06:44:05,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 384 [2020-10-20 06:44:05,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 384 [2020-10-20 06:44:05,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 726 states and 976 transitions. [2020-10-20 06:44:05,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:05,983 INFO L691 BuchiCegarLoop]: Abstraction has 726 states and 976 transitions. [2020-10-20 06:44:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states and 976 transitions. [2020-10-20 06:44:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 704. [2020-10-20 06:44:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2020-10-20 06:44:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 941 transitions. [2020-10-20 06:44:06,008 INFO L714 BuchiCegarLoop]: Abstraction has 704 states and 941 transitions. [2020-10-20 06:44:06,008 INFO L594 BuchiCegarLoop]: Abstraction has 704 states and 941 transitions. [2020-10-20 06:44:06,008 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:44:06,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 704 states and 941 transitions. [2020-10-20 06:44:06,013 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 244 [2020-10-20 06:44:06,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:06,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:06,014 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-20 06:44:06,014 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:44:06,014 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-20 06:44:06,015 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1972362948, now seen corresponding path program 2 times [2020-10-20 06:44:06,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:06,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97047845] [2020-10-20 06:44:06,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:06,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:06,035 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:06,039 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:06,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:06,039 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2020-10-20 06:44:06,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:06,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156238305] [2020-10-20 06:44:06,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:06,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:06,049 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:06,051 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:06,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash -857421960, now seen corresponding path program 1 times [2020-10-20 06:44:06,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:06,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247353151] [2020-10-20 06:44:06,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:06,065 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:06,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:06,084 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:06,234 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2020-10-20 06:44:06,746 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2020-10-20 06:44:07,004 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2020-10-20 06:44:07,587 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 118 [2020-10-20 06:44:07,739 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-20 06:44:07,743 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:44:07,743 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:44:07,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:44:07,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:44:07,743 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:44:07,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:07,743 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:44:07,744 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:44:07,744 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration10_Lasso [2020-10-20 06:44:07,744 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:44:07,744 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:44:07,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-20 06:44:07,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:07,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:07,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-20 06:44:07,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:07,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-20 06:44:07,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-20 06:44:08,242 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 117 [2020-10-20 06:44:08,408 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-10-20 06:44:08,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:08,745 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-20 06:44:09,111 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-20 06:44:09,361 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-20 06:44:09,623 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-10-20 06:44:09,753 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:44:09,753 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-20 06:44:09,757 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-20 06:44:09,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:09,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:09,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:09,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:09,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:09,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:09,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:09,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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:44:09,782 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-20 06:44:09,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:09,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:09,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:09,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:09,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:09,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:09,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:09,786 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) [2020-10-20 06:44:09,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 Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:09,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:09,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:09,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:09,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:09,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:09,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:09,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:09,813 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) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:09,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-20 06:44:09,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:09,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:09,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:09,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:09,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:09,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:09,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:09,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 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-20 06:44:09,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-20 06:44:09,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:09,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:09,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:09,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:09,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:09,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:09,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:09,862 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) [2020-10-20 06:44:09,884 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-20 06:44:09,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:09,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:09,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:09,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:09,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:09,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:09,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:09,888 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) Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:09,909 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-20 06:44:09,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:09,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:09,911 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-10-20 06:44:09,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:10,002 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2020-10-20 06:44:10,002 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2020-10-20 06:44:10,619 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:44:12,551 INFO L443 ModelExtractionUtils]: Simplification made 66 calls to the SMT solver. [2020-10-20 06:44:12,552 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-20 06:44:12,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:44:12,560 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2020-10-20 06:44:12,560 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:44:12,560 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-20 06:44:12,633 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2020-10-20 06:44:12,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:44:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:12,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:44:12,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:12,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:44:12,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:12,784 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-20 06:44:12,785 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-20 06:44:12,785 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 704 states and 941 transitions. cyclomatic complexity: 290 Second operand 6 states. [2020-10-20 06:44:12,866 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-20 06:44:12,866 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-20 06:44:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:44:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-10-20 06:44:12,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 23 letters. Loop has 8 letters. [2020-10-20 06:44:12,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:12,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 31 letters. Loop has 8 letters. [2020-10-20 06:44:12,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:12,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 23 letters. Loop has 16 letters. [2020-10-20 06:44:12,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:12,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1278 states and 1682 transitions. [2020-10-20 06:44:12,884 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 268 [2020-10-20 06:44:12,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1278 states to 1231 states and 1618 transitions. [2020-10-20 06:44:12,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2020-10-20 06:44:12,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 557 [2020-10-20 06:44:12,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1231 states and 1618 transitions. [2020-10-20 06:44:12,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:12,900 INFO L691 BuchiCegarLoop]: Abstraction has 1231 states and 1618 transitions. [2020-10-20 06:44:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states and 1618 transitions. [2020-10-20 06:44:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1190. [2020-10-20 06:44:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2020-10-20 06:44:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1573 transitions. [2020-10-20 06:44:12,937 INFO L714 BuchiCegarLoop]: Abstraction has 1190 states and 1573 transitions. [2020-10-20 06:44:12,937 INFO L594 BuchiCegarLoop]: Abstraction has 1190 states and 1573 transitions. [2020-10-20 06:44:12,937 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:44:12,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1190 states and 1573 transitions. [2020-10-20 06:44:12,945 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 264 [2020-10-20 06:44:12,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:12,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:12,946 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-20 06:44:12,947 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:44:12,947 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-20 06:44:12,947 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-20 06:44:12,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:12,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1013709224, now seen corresponding path program 1 times [2020-10-20 06:44:12,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:12,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029518832] [2020-10-20 06:44:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:12,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-20 06:44:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:12,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-20 06:44:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:12,987 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-20 06:44:12,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029518832] [2020-10-20 06:44:12,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:44:12,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 06:44:12,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594419375] [2020-10-20 06:44:12,989 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:12,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2020-10-20 06:44:12,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:12,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852572661] [2020-10-20 06:44:12,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:12,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:12,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:12,995 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:13,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:13,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:44:13,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:44:13,034 INFO L87 Difference]: Start difference. First operand 1190 states and 1573 transitions. cyclomatic complexity: 474 Second operand 5 states. [2020-10-20 06:44:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:13,146 INFO L93 Difference]: Finished difference Result 1292 states and 1596 transitions. [2020-10-20 06:44:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:44:13,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1292 states and 1596 transitions. [2020-10-20 06:44:13,161 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 246 [2020-10-20 06:44:13,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1292 states to 1292 states and 1596 transitions. [2020-10-20 06:44:13,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 514 [2020-10-20 06:44:13,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 514 [2020-10-20 06:44:13,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1292 states and 1596 transitions. [2020-10-20 06:44:13,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:13,369 INFO L691 BuchiCegarLoop]: Abstraction has 1292 states and 1596 transitions. [2020-10-20 06:44:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states and 1596 transitions. [2020-10-20 06:44:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 954. [2020-10-20 06:44:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2020-10-20 06:44:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1210 transitions. [2020-10-20 06:44:13,414 INFO L714 BuchiCegarLoop]: Abstraction has 954 states and 1210 transitions. [2020-10-20 06:44:13,414 INFO L594 BuchiCegarLoop]: Abstraction has 954 states and 1210 transitions. [2020-10-20 06:44:13,414 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:44:13,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 954 states and 1210 transitions. [2020-10-20 06:44:13,420 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 244 [2020-10-20 06:44:13,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:13,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:13,426 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:44:13,427 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:44:13,428 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-20 06:44:13,428 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-20 06:44:13,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:13,429 INFO L82 PathProgramCache]: Analyzing trace with hash 384755823, now seen corresponding path program 3 times [2020-10-20 06:44:13,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:13,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822156066] [2020-10-20 06:44:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:13,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-20 06:44:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:13,523 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-20 06:44:13,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822156066] [2020-10-20 06:44:13,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790127242] [2020-10-20 06:44:13,523 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-20 06:44:13,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 06:44:13,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:44:13,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:44:13,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:13,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:44:13,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:44:13,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:44:13,652 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-20 06:44:13,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:44:13,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2020-10-20 06:44:13,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021849824] [2020-10-20 06:44:13,653 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:13,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 4 times [2020-10-20 06:44:13,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:13,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213195300] [2020-10-20 06:44:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:13,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:13,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:13,661 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:13,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:13,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 06:44:13,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-10-20 06:44:13,797 INFO L87 Difference]: Start difference. First operand 954 states and 1210 transitions. cyclomatic complexity: 327 Second operand 14 states. [2020-10-20 06:44:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:14,150 INFO L93 Difference]: Finished difference Result 1078 states and 1373 transitions. [2020-10-20 06:44:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 06:44:14,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1078 states and 1373 transitions. [2020-10-20 06:44:14,159 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 284 [2020-10-20 06:44:14,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1078 states to 1074 states and 1369 transitions. [2020-10-20 06:44:14,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 468 [2020-10-20 06:44:14,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 471 [2020-10-20 06:44:14,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1074 states and 1369 transitions. [2020-10-20 06:44:14,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:14,170 INFO L691 BuchiCegarLoop]: Abstraction has 1074 states and 1369 transitions. [2020-10-20 06:44:14,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states and 1369 transitions. [2020-10-20 06:44:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 988. [2020-10-20 06:44:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2020-10-20 06:44:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1256 transitions. [2020-10-20 06:44:14,203 INFO L714 BuchiCegarLoop]: Abstraction has 988 states and 1256 transitions. [2020-10-20 06:44:14,203 INFO L594 BuchiCegarLoop]: Abstraction has 988 states and 1256 transitions. [2020-10-20 06:44:14,203 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 06:44:14,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1256 transitions. [2020-10-20 06:44:14,210 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 264 [2020-10-20 06:44:14,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:14,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:14,212 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:44:14,212 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:44:14,213 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-20 06:44:14,213 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-20 06:44:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:14,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1495319133, now seen corresponding path program 4 times [2020-10-20 06:44:14,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:14,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053557897] [2020-10-20 06:44:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:14,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:44:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:14,450 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-20 06:44:14,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053557897] [2020-10-20 06:44:14,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41729671] [2020-10-20 06:44:14,451 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-20 06:44:14,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:44:14,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:44:14,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 06:44:14,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:14,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:44:14,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:44:14,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:44:14,645 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-20 06:44:14,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:44:14,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2020-10-20 06:44:14,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120729628] [2020-10-20 06:44:14,646 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:14,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 5 times [2020-10-20 06:44:14,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:14,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513628127] [2020-10-20 06:44:14,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:14,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:14,653 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:14,654 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:14,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:14,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-20 06:44:14,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-10-20 06:44:14,791 INFO L87 Difference]: Start difference. First operand 988 states and 1256 transitions. cyclomatic complexity: 340 Second operand 18 states. [2020-10-20 06:44:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:15,429 INFO L93 Difference]: Finished difference Result 1166 states and 1473 transitions. [2020-10-20 06:44:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-20 06:44:15,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1166 states and 1473 transitions. [2020-10-20 06:44:15,439 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 298 [2020-10-20 06:44:15,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1166 states to 1159 states and 1466 transitions. [2020-10-20 06:44:15,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 508 [2020-10-20 06:44:15,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 511 [2020-10-20 06:44:15,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1159 states and 1466 transitions. [2020-10-20 06:44:15,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:15,452 INFO L691 BuchiCegarLoop]: Abstraction has 1159 states and 1466 transitions. [2020-10-20 06:44:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states and 1466 transitions. [2020-10-20 06:44:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1076. [2020-10-20 06:44:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2020-10-20 06:44:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1356 transitions. [2020-10-20 06:44:15,493 INFO L714 BuchiCegarLoop]: Abstraction has 1076 states and 1356 transitions. [2020-10-20 06:44:15,494 INFO L594 BuchiCegarLoop]: Abstraction has 1076 states and 1356 transitions. [2020-10-20 06:44:15,494 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 06:44:15,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1076 states and 1356 transitions. [2020-10-20 06:44:15,501 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 280 [2020-10-20 06:44:15,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:15,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:15,505 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-20 06:44:15,505 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:44:15,506 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-20 06:44:15,506 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:15,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:15,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1497650635, now seen corresponding path program 1 times [2020-10-20 06:44:15,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:15,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826469030] [2020-10-20 06:44:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:15,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:15,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:15,540 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:15,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:15,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1895288687, now seen corresponding path program 2 times [2020-10-20 06:44:15,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:15,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966912085] [2020-10-20 06:44:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:15,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:15,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:15,549 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:15,551 INFO L82 PathProgramCache]: Analyzing trace with hash -158128711, now seen corresponding path program 1 times [2020-10-20 06:44:15,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:15,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282315345] [2020-10-20 06:44:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:15,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:15,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:15,605 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:16,373 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 161 [2020-10-20 06:44:16,629 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2020-10-20 06:44:16,812 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2020-10-20 06:44:17,026 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-20 06:44:17,158 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-20 06:44:17,704 WARN L193 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 149 [2020-10-20 06:44:17,911 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-20 06:44:17,914 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:44:17,914 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:44:17,914 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:44:17,914 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:44:17,915 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:44:17,915 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:17,915 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:44:17,915 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:44:17,915 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration14_Lasso [2020-10-20 06:44:17,915 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:44:17,915 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:44:17,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:17,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-20 06:44:17,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-20 06:44:17,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-20 06:44:17,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-20 06:44:18,459 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 127 [2020-10-20 06:44:18,604 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2020-10-20 06:44:18,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,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-20 06:44:18,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,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-20 06:44:18,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,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-20 06:44:18,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-20 06:44:18,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:18,952 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2020-10-20 06:44:19,329 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-20 06:44:19,486 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-20 06:44:19,757 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-10-20 06:44:19,898 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:44:19,899 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-20 06:44:19,907 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-20 06:44:19,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:19,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:19,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:19,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:19,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:19,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:19,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:19,910 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-20 06:44:19,931 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-20 06:44:19,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:19,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:19,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:19,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:19,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:19,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:19,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:19,934 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-20 06:44:19,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-20 06:44:19,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:19,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:19,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:19,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:19,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:19,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:19,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:19,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 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-20 06:44:19,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-20 06:44:19,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:19,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:19,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:19,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:19,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:19,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:19,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:19,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 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-20 06:44:20,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-20 06:44:20,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:20,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:20,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:20,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:20,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:20,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:20,013 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-20 06:44:20,053 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-20 06:44:20,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:20,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:20,057 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:44:20,057 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-20 06:44:20,093 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-20 06:44:20,094 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 06:44:20,214 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:44:20,410 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2020-10-20 06:44:20,410 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-20 06:44:20,413 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:44:20,416 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-20 06:44:20,416 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:44:20,416 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-20 06:44:20,476 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 06:44:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:20,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:44:20,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:20,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:44:20,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:20,585 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-20 06:44:20,585 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-20 06:44:20,585 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1076 states and 1356 transitions. cyclomatic complexity: 358 Second operand 6 states. [2020-10-20 06:44:20,720 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-20 06:44:20,720 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-20 06:44:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:44:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-10-20 06:44:20,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 27 letters. Loop has 6 letters. [2020-10-20 06:44:20,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:20,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 33 letters. Loop has 6 letters. [2020-10-20 06:44:20,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:20,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 27 letters. Loop has 12 letters. [2020-10-20 06:44:20,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:20,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1908 states and 2417 transitions. [2020-10-20 06:44:20,738 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 182 [2020-10-20 06:44:20,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1908 states to 1531 states and 1950 transitions. [2020-10-20 06:44:20,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2020-10-20 06:44:20,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 630 [2020-10-20 06:44:20,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1531 states and 1950 transitions. [2020-10-20 06:44:20,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:20,752 INFO L691 BuchiCegarLoop]: Abstraction has 1531 states and 1950 transitions. [2020-10-20 06:44:20,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states and 1950 transitions. [2020-10-20 06:44:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1180. [2020-10-20 06:44:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2020-10-20 06:44:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1577 transitions. [2020-10-20 06:44:20,781 INFO L714 BuchiCegarLoop]: Abstraction has 1180 states and 1577 transitions. [2020-10-20 06:44:20,781 INFO L594 BuchiCegarLoop]: Abstraction has 1180 states and 1577 transitions. [2020-10-20 06:44:20,781 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 06:44:20,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1180 states and 1577 transitions. [2020-10-20 06:44:20,787 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 176 [2020-10-20 06:44:20,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:20,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:20,788 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:44:20,788 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:44:20,788 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-20 06:44:20,789 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-20 06:44:20,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:20,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1038514783, now seen corresponding path program 5 times [2020-10-20 06:44:20,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:20,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515999713] [2020-10-20 06:44:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:21,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-20 06:44:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:21,038 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-20 06:44:21,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515999713] [2020-10-20 06:44:21,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809071338] [2020-10-20 06:44:21,039 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-20 06:44:21,096 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2020-10-20 06:44:21,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:44:21,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:44:21,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:21,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:44:21,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:44:21,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:44:21,322 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-20 06:44:21,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:44:21,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2020-10-20 06:44:21,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549766059] [2020-10-20 06:44:21,323 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 6 times [2020-10-20 06:44:21,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:21,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341804775] [2020-10-20 06:44:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:21,326 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:21,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:21,329 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:21,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:21,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-20 06:44:21,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2020-10-20 06:44:21,473 INFO L87 Difference]: Start difference. First operand 1180 states and 1577 transitions. cyclomatic complexity: 471 Second operand 26 states. [2020-10-20 06:44:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:23,488 INFO L93 Difference]: Finished difference Result 1020 states and 1357 transitions. [2020-10-20 06:44:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-10-20 06:44:23,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1020 states and 1357 transitions. [2020-10-20 06:44:23,497 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 356 [2020-10-20 06:44:23,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1020 states to 1009 states and 1345 transitions. [2020-10-20 06:44:23,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 644 [2020-10-20 06:44:23,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2020-10-20 06:44:23,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1009 states and 1345 transitions. [2020-10-20 06:44:23,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:23,506 INFO L691 BuchiCegarLoop]: Abstraction has 1009 states and 1345 transitions. [2020-10-20 06:44:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states and 1345 transitions. [2020-10-20 06:44:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 772. [2020-10-20 06:44:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-10-20 06:44:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1021 transitions. [2020-10-20 06:44:23,525 INFO L714 BuchiCegarLoop]: Abstraction has 772 states and 1021 transitions. [2020-10-20 06:44:23,525 INFO L594 BuchiCegarLoop]: Abstraction has 772 states and 1021 transitions. [2020-10-20 06:44:23,525 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-20 06:44:23,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 772 states and 1021 transitions. [2020-10-20 06:44:23,529 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-20 06:44:23,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:23,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:23,530 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-20 06:44:23,530 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:44:23,530 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:23,530 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-20 06:44:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash 964730358, now seen corresponding path program 1 times [2020-10-20 06:44:23,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:23,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036844299] [2020-10-20 06:44:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:23,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-20 06:44:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:23,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-20 06:44:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:23,586 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-20 06:44:23,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036844299] [2020-10-20 06:44:23,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249279954] [2020-10-20 06:44:23,587 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-20 06:44:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:23,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:44:23,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:23,687 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-20 06:44:23,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:44:23,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-10-20 06:44:23,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613505489] [2020-10-20 06:44:23,689 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:23,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2020-10-20 06:44:23,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:23,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149360848] [2020-10-20 06:44:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:23,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:23,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:23,695 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:23,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:23,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:44:23,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:44:23,738 INFO L87 Difference]: Start difference. First operand 772 states and 1021 transitions. cyclomatic complexity: 296 Second operand 8 states. [2020-10-20 06:44:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:23,861 INFO L93 Difference]: Finished difference Result 1430 states and 1785 transitions. [2020-10-20 06:44:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:44:23,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1430 states and 1785 transitions. [2020-10-20 06:44:23,876 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-20 06:44:23,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1430 states to 1406 states and 1755 transitions. [2020-10-20 06:44:23,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 676 [2020-10-20 06:44:23,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 676 [2020-10-20 06:44:23,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1406 states and 1755 transitions. [2020-10-20 06:44:23,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:23,889 INFO L691 BuchiCegarLoop]: Abstraction has 1406 states and 1755 transitions. [2020-10-20 06:44:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states and 1755 transitions. [2020-10-20 06:44:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 814. [2020-10-20 06:44:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2020-10-20 06:44:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1052 transitions. [2020-10-20 06:44:23,912 INFO L714 BuchiCegarLoop]: Abstraction has 814 states and 1052 transitions. [2020-10-20 06:44:23,912 INFO L594 BuchiCegarLoop]: Abstraction has 814 states and 1052 transitions. [2020-10-20 06:44:23,912 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-20 06:44:23,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 814 states and 1052 transitions. [2020-10-20 06:44:23,920 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-20 06:44:23,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:23,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:23,922 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-20 06:44:23,922 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:44:23,922 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:23,922 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-20 06:44:23,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash 64206937, now seen corresponding path program 1 times [2020-10-20 06:44:23,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:23,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197587404] [2020-10-20 06:44:23,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:23,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:23,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:24,001 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:24,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2020-10-20 06:44:24,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:24,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622953542] [2020-10-20 06:44:24,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:24,010 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:24,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:24,012 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:24,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:24,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1573325915, now seen corresponding path program 1 times [2020-10-20 06:44:24,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:24,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080554363] [2020-10-20 06:44:24,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:24,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:24,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:24,076 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:25,214 WARN L193 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 193 [2020-10-20 06:44:25,359 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-20 06:44:25,556 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2020-10-20 06:44:25,762 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-20 06:44:25,889 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-20 06:44:26,572 WARN L193 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 147 [2020-10-20 06:44:26,835 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-20 06:44:26,838 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:44:26,838 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:44:26,838 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:44:26,838 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:44:26,838 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:44:26,838 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:26,838 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:44:26,838 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:44:26,838 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration17_Lasso [2020-10-20 06:44:26,838 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:44:26,839 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:44:26,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:26,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:27,483 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 124 [2020-10-20 06:44:27,602 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2020-10-20 06:44:27,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:27,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:27,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:27,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:27,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-20 06:44:27,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:27,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-20 06:44:27,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:27,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-20 06:44:27,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:27,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:27,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:27,968 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2020-10-20 06:44:28,562 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-10-20 06:44:28,652 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:44:28,652 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) [2020-10-20 06:44:28,660 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-20 06:44:28,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:28,663 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-20 06:44:28,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 [2020-10-20 06:44:28,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,686 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-20 06:44:28,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-20 06:44:28,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,710 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-20 06:44:28,733 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-20 06:44:28,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,735 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-20 06:44:28,758 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-20 06:44:28,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,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 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-20 06:44:28,782 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-20 06:44:28,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:28,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:28,788 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-20 06:44:28,810 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-20 06:44:28,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,813 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-20 06:44:28,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-20 06:44:28,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,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 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-20 06:44:28,857 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-20 06:44:28,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,859 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-20 06:44:28,880 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-20 06:44:28,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,883 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-20 06:44:28,908 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-20 06:44:28,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,911 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-20 06:44:28,932 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-20 06:44:28,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,935 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-20 06:44:28,956 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-20 06:44:28,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,962 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-20 06:44:28,983 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-20 06:44:28,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:28,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:28,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:28,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:28,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:28,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:28,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:28,987 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-20 06:44:29,008 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-20 06:44:29,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:29,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:29,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:29,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:29,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:29,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:29,013 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-20 06:44:29,034 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-20 06:44:29,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:29,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:29,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:29,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:29,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:29,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:29,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:29,037 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-20 06:44:29,058 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-20 06:44:29,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:29,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:29,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:29,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:29,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:29,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:29,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:29,061 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-20 06:44:29,083 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-20 06:44:29,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:29,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:29,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:29,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:29,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:29,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:29,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:29,086 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-20 06:44:29,108 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-20 06:44:29,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:29,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:29,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:29,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:29,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:29,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:29,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:29,111 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-20 06:44:29,134 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-20 06:44:29,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:29,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:29,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:29,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:29,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:29,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:29,140 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-20 06:44:29,161 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-20 06:44:29,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:29,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:29,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:29,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:29,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:29,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:29,169 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-20 06:44:29,200 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-20 06:44:29,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:29,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:29,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:29,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:29,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:29,205 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-20 06:44:29,211 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-20 06:44:29,240 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-20 06:44:29,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:29,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:29,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:29,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:29,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:29,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:29,251 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-20 06:44:29,272 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-20 06:44:29,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:29,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:29,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:29,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:29,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:29,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:29,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:44:29,364 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2020-10-20 06:44:29,364 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-20 06:44:29,367 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:44:29,368 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 06:44:29,369 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:44:29,369 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-20 06:44:29,449 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2020-10-20 06:44:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:29,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 06:44:29,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:29,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:44:29,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:29,671 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-20 06:44:29,671 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-20 06:44:29,671 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 814 states and 1052 transitions. cyclomatic complexity: 285 Second operand 11 states. [2020-10-20 06:44:30,105 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-20 06:44:30,106 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-20 06:44:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 06:44:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-10-20 06:44:30,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 36 letters. Loop has 2 letters. [2020-10-20 06:44:30,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:30,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 38 letters. Loop has 2 letters. [2020-10-20 06:44:30,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:30,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 36 letters. Loop has 4 letters. [2020-10-20 06:44:30,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:30,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 904 states and 1169 transitions. [2020-10-20 06:44:30,114 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-20 06:44:30,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 904 states to 820 states and 1062 transitions. [2020-10-20 06:44:30,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 487 [2020-10-20 06:44:30,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2020-10-20 06:44:30,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 820 states and 1062 transitions. [2020-10-20 06:44:30,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:30,121 INFO L691 BuchiCegarLoop]: Abstraction has 820 states and 1062 transitions. [2020-10-20 06:44:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states and 1062 transitions. [2020-10-20 06:44:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 801. [2020-10-20 06:44:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-10-20 06:44:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1038 transitions. [2020-10-20 06:44:30,141 INFO L714 BuchiCegarLoop]: Abstraction has 801 states and 1038 transitions. [2020-10-20 06:44:30,141 INFO L594 BuchiCegarLoop]: Abstraction has 801 states and 1038 transitions. [2020-10-20 06:44:30,142 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-20 06:44:30,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 1038 transitions. [2020-10-20 06:44:30,146 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-20 06:44:30,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:30,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:30,148 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-20 06:44:30,148 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:44:30,148 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:30,148 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-20 06:44:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1607578857, now seen corresponding path program 2 times [2020-10-20 06:44:30,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:30,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209173223] [2020-10-20 06:44:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:30,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:44:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:30,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-10-20 06:44:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:30,313 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-20 06:44:30,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209173223] [2020-10-20 06:44:30,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602012214] [2020-10-20 06:44:30,314 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-20 06:44:30,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:44:30,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:44:30,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:44:30,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:30,466 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-20 06:44:30,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:44:30,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2020-10-20 06:44:30,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995239718] [2020-10-20 06:44:30,467 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:30,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:30,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2020-10-20 06:44:30,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:30,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129662210] [2020-10-20 06:44:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:30,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:30,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:30,474 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:30,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-20 06:44:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-10-20 06:44:30,519 INFO L87 Difference]: Start difference. First operand 801 states and 1038 transitions. cyclomatic complexity: 284 Second operand 17 states. [2020-10-20 06:44:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:30,975 INFO L93 Difference]: Finished difference Result 773 states and 995 transitions. [2020-10-20 06:44:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 06:44:30,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 773 states and 995 transitions. [2020-10-20 06:44:30,982 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 198 [2020-10-20 06:44:30,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 773 states to 769 states and 991 transitions. [2020-10-20 06:44:30,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 498 [2020-10-20 06:44:30,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2020-10-20 06:44:30,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 769 states and 991 transitions. [2020-10-20 06:44:30,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:30,989 INFO L691 BuchiCegarLoop]: Abstraction has 769 states and 991 transitions. [2020-10-20 06:44:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states and 991 transitions. [2020-10-20 06:44:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 731. [2020-10-20 06:44:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2020-10-20 06:44:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 945 transitions. [2020-10-20 06:44:31,004 INFO L714 BuchiCegarLoop]: Abstraction has 731 states and 945 transitions. [2020-10-20 06:44:31,004 INFO L594 BuchiCegarLoop]: Abstraction has 731 states and 945 transitions. [2020-10-20 06:44:31,005 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-20 06:44:31,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 731 states and 945 transitions. [2020-10-20 06:44:31,007 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 176 [2020-10-20 06:44:31,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:31,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:31,011 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-20 06:44:31,011 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:44:31,011 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:31,012 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-20 06:44:31,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:31,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1148372884, now seen corresponding path program 3 times [2020-10-20 06:44:31,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:31,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305209786] [2020-10-20 06:44:31,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:31,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:31,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:31,065 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 5 times [2020-10-20 06:44:31,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:31,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938229796] [2020-10-20 06:44:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:31,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:31,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:31,072 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:31,072 INFO L82 PathProgramCache]: Analyzing trace with hash -220251946, now seen corresponding path program 2 times [2020-10-20 06:44:31,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:31,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532346968] [2020-10-20 06:44:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:31,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:31,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:31,118 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:32,110 WARN L193 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 190 [2020-10-20 06:44:32,274 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-20 06:44:32,513 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-20 06:44:32,618 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-20 06:44:32,956 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-10-20 06:44:33,102 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-20 06:44:33,596 WARN L193 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 104 [2020-10-20 06:44:33,883 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-20 06:44:34,034 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-20 06:44:35,108 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 168 DAG size of output: 159 [2020-10-20 06:44:35,834 WARN L193 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 136 [2020-10-20 06:44:35,836 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:44:35,836 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:44:35,836 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:44:35,836 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:44:35,837 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:44:35,837 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:35,837 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:44:35,837 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:44:35,837 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration19_Lasso [2020-10-20 06:44:35,837 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:44:35,837 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:44:35,838 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-20 06:44:35,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:35,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:36,605 WARN L193 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 132 [2020-10-20 06:44:36,758 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2020-10-20 06:44:36,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:36,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:36,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-20 06:44:36,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-20 06:44:36,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:36,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-20 06:44:36,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:37,127 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2020-10-20 06:44:37,541 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-20 06:44:37,838 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-10-20 06:44:37,970 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:44:37,970 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-20 06:44:37,972 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-20 06:44:37,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:37,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:37,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:37,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:37,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:37,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:37,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:37,975 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) [2020-10-20 06:44:38,004 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-20 06:44:38,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:38,008 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-20 06:44:38,029 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-20 06:44:38,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,032 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-20 06:44:38,054 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-20 06:44:38,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,057 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-20 06:44:38,079 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-20 06:44:38,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,082 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-20 06:44:38,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-20 06:44:38,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,106 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-20 06:44:38,127 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-20 06:44:38,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,132 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-20 06:44:38,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-20 06:44:38,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,156 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-20 06:44:38,177 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-20 06:44:38,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,180 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-20 06:44:38,201 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-20 06:44:38,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,204 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-20 06:44:38,225 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-20 06:44:38,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,228 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-20 06:44:38,249 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-20 06:44:38,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,252 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-20 06:44:38,273 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-20 06:44:38,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,276 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-20 06:44:38,299 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-20 06:44:38,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,302 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-20 06:44:38,323 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-20 06:44:38,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,327 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-20 06:44:38,349 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-20 06:44:38,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,352 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-20 06:44:38,374 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-20 06:44:38,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:38,377 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-20 06:44:38,401 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-20 06:44:38,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:38,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:38,408 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-20 06:44:38,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-20 06:44:38,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,444 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-20 06:44:38,446 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-20 06:44:38,504 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-20 06:44:38,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,507 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-20 06:44:38,509 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-20 06:44:38,571 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-20 06:44:38,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,575 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-20 06:44:38,577 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-20 06:44:38,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-20 06:44:38,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 150 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:38,635 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-20 06:44:38,693 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-20 06:44:38,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,697 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-20 06:44:38,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 152 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:44:38,760 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-20 06:44:38,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:38,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:38,764 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-20 06:44:38,767 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-20 06:44:38,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-20 06:44:38,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:38,808 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-20 06:44:38,814 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-20 06:44:38,848 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-20 06:44:38,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:38,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:38,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:38,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:38,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:38,862 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-20 06:44:38,894 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:44:38,931 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-20 06:44:38,932 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-20 06:44:38,934 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:44:38,936 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:44:38,936 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:44:38,936 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-20 06:44:39,072 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2020-10-20 06:44:39,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:39,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:44:39,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:39,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:44:39,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:39,180 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-20 06:44:39,180 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-20 06:44:39,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 731 states and 945 transitions. cyclomatic complexity: 257 Second operand 4 states. [2020-10-20 06:44:39,241 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-20 06:44:39,244 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-20 06:44:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:44:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-10-20 06:44:39,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 43 letters. Loop has 2 letters. [2020-10-20 06:44:39,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:39,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 45 letters. Loop has 2 letters. [2020-10-20 06:44:39,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:39,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 43 letters. Loop has 4 letters. [2020-10-20 06:44:39,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:39,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 762 states and 992 transitions. [2020-10-20 06:44:39,250 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 168 [2020-10-20 06:44:39,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 762 states to 742 states and 962 transitions. [2020-10-20 06:44:39,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 456 [2020-10-20 06:44:39,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 461 [2020-10-20 06:44:39,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 742 states and 962 transitions. [2020-10-20 06:44:39,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:39,257 INFO L691 BuchiCegarLoop]: Abstraction has 742 states and 962 transitions. [2020-10-20 06:44:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states and 962 transitions. [2020-10-20 06:44:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 739. [2020-10-20 06:44:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-10-20 06:44:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 959 transitions. [2020-10-20 06:44:39,272 INFO L714 BuchiCegarLoop]: Abstraction has 739 states and 959 transitions. [2020-10-20 06:44:39,272 INFO L594 BuchiCegarLoop]: Abstraction has 739 states and 959 transitions. [2020-10-20 06:44:39,272 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-20 06:44:39,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 739 states and 959 transitions. [2020-10-20 06:44:39,275 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 168 [2020-10-20 06:44:39,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:39,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:39,276 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-20 06:44:39,276 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:44:39,277 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:39,277 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:39,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1719261906, now seen corresponding path program 1 times [2020-10-20 06:44:39,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:39,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711598002] [2020-10-20 06:44:39,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:39,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:44:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:39,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-10-20 06:44:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:39,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:44:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:39,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-20 06:44:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:39,360 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-20 06:44:39,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711598002] [2020-10-20 06:44:39,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688104276] [2020-10-20 06:44:39,360 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-20 06:44:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:39,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-20 06:44:39,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:39,643 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-20 06:44:39,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:44:39,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14] total 18 [2020-10-20 06:44:39,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921227662] [2020-10-20 06:44:39,644 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:39,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:39,645 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2020-10-20 06:44:39,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:39,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956499621] [2020-10-20 06:44:39,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:39,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:39,653 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:39,654 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:39,807 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2020-10-20 06:44:39,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:39,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-20 06:44:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-10-20 06:44:39,855 INFO L87 Difference]: Start difference. First operand 739 states and 959 transitions. cyclomatic complexity: 264 Second operand 18 states. [2020-10-20 06:44:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:40,733 INFO L93 Difference]: Finished difference Result 960 states and 1212 transitions. [2020-10-20 06:44:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-20 06:44:40,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 960 states and 1212 transitions. [2020-10-20 06:44:40,739 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 254 [2020-10-20 06:44:40,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 960 states to 960 states and 1212 transitions. [2020-10-20 06:44:40,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 634 [2020-10-20 06:44:40,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 634 [2020-10-20 06:44:40,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 960 states and 1212 transitions. [2020-10-20 06:44:40,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:40,748 INFO L691 BuchiCegarLoop]: Abstraction has 960 states and 1212 transitions. [2020-10-20 06:44:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states and 1212 transitions. [2020-10-20 06:44:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 745. [2020-10-20 06:44:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2020-10-20 06:44:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 960 transitions. [2020-10-20 06:44:40,764 INFO L714 BuchiCegarLoop]: Abstraction has 745 states and 960 transitions. [2020-10-20 06:44:40,764 INFO L594 BuchiCegarLoop]: Abstraction has 745 states and 960 transitions. [2020-10-20 06:44:40,764 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-20 06:44:40,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 745 states and 960 transitions. [2020-10-20 06:44:40,767 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 168 [2020-10-20 06:44:40,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:40,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:40,768 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-20 06:44:40,768 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:44:40,768 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:40,769 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:40,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2004988308, now seen corresponding path program 1 times [2020-10-20 06:44:40,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:40,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465657125] [2020-10-20 06:44:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:40,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:44:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:40,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-10-20 06:44:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:40,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:44:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:40,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-20 06:44:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:40,910 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-20 06:44:40,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465657125] [2020-10-20 06:44:40,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872741428] [2020-10-20 06:44:40,911 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-20 06:44:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:41,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 06:44:41,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:41,228 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-20 06:44:41,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:44:41,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2020-10-20 06:44:41,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220860895] [2020-10-20 06:44:41,230 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:41,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:41,230 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2020-10-20 06:44:41,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:41,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552287464] [2020-10-20 06:44:41,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:41,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:41,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:41,242 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:41,404 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2020-10-20 06:44:41,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-20 06:44:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2020-10-20 06:44:41,465 INFO L87 Difference]: Start difference. First operand 745 states and 960 transitions. cyclomatic complexity: 259 Second operand 21 states. [2020-10-20 06:44:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:44,121 INFO L93 Difference]: Finished difference Result 2711 states and 3571 transitions. [2020-10-20 06:44:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-10-20 06:44:44,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2711 states and 3571 transitions. [2020-10-20 06:44:44,136 INFO L131 ngComponentsAnalysis]: Automaton has 87 accepting balls. 690 [2020-10-20 06:44:44,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2711 states to 2705 states and 3565 transitions. [2020-10-20 06:44:44,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1664 [2020-10-20 06:44:44,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1664 [2020-10-20 06:44:44,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2705 states and 3565 transitions. [2020-10-20 06:44:44,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:44:44,156 INFO L691 BuchiCegarLoop]: Abstraction has 2705 states and 3565 transitions. [2020-10-20 06:44:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states and 3565 transitions. [2020-10-20 06:44:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 1111. [2020-10-20 06:44:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2020-10-20 06:44:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1441 transitions. [2020-10-20 06:44:44,189 INFO L714 BuchiCegarLoop]: Abstraction has 1111 states and 1441 transitions. [2020-10-20 06:44:44,189 INFO L594 BuchiCegarLoop]: Abstraction has 1111 states and 1441 transitions. [2020-10-20 06:44:44,190 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-20 06:44:44,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1111 states and 1441 transitions. [2020-10-20 06:44:44,193 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 288 [2020-10-20 06:44:44,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:44,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:44,194 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-20 06:44:44,194 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:44:44,195 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:44,195 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~post3;havoc merge_#t~ite14;havoc merge_#t~ite15;havoc merge_#t~mem4;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~mem10;havoc merge_#t~mem6;havoc merge_#t~post9;havoc merge_#t~ite13;havoc merge_#t~mem12;havoc merge_#t~post11;havoc merge_#t~post5; 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-20 06:44:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:44,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1710153686, now seen corresponding path program 2 times [2020-10-20 06:44:44,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:44,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061476325] [2020-10-20 06:44:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:44,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:44,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:44,282 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:44,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:44,283 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 4 times [2020-10-20 06:44:44,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:44,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249967372] [2020-10-20 06:44:44,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:44,287 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:44,290 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:44,292 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1618831734, now seen corresponding path program 3 times [2020-10-20 06:44:44,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:44,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775387291] [2020-10-20 06:44:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:44,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:44,370 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:44,392 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:44,542 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2020-10-20 06:44:47,481 WARN L193 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 285 DAG size of output: 223 [2020-10-20 06:44:47,929 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-20 06:44:48,423 WARN L193 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-10-20 06:44:48,973 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-20 06:44:53,488 WARN L193 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 286 DAG size of output: 246 [2020-10-20 06:44:55,512 WARN L193 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 153 [2020-10-20 06:44:55,805 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2020-10-20 06:44:56,866 WARN L193 SmtUtils]: Spent 980.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-10-20 06:44:58,099 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 153 [2020-10-20 06:45:00,864 WARN L193 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 209 DAG size of output: 196 [2020-10-20 06:45:02,176 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 173 [2020-10-20 06:45:02,179 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:45:02,179 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:45:02,179 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:45:02,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:45:02,180 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:45:02,180 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:02,180 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:45:02,180 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:45:02,180 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration22_Lasso [2020-10-20 06:45:02,180 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:45:02,180 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:45:02,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:02,857 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-20 06:45:02,860 INFO L168 Benchmark]: Toolchain (without parser) took 76516.29 ms. Allocated memory was 41.4 MB in the beginning and 315.1 MB in the end (delta: 273.7 MB). Free memory was 22.8 MB in the beginning and 159.7 MB in the end (delta: -136.9 MB). Peak memory consumption was 291.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:02,861 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 31.5 MB. Free memory was 7.7 MB in the beginning and 7.6 MB in the end (delta: 84.1 kB). Peak memory consumption was 84.1 kB. Max. memory is 14.3 GB. [2020-10-20 06:45:02,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.35 ms. Allocated memory was 41.4 MB in the beginning and 44.6 MB in the end (delta: 3.1 MB). Free memory was 21.9 MB in the beginning and 24.8 MB in the end (delta: -2.9 MB). Peak memory consumption was 11.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:02,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.87 ms. Allocated memory is still 44.6 MB. Free memory was 24.8 MB in the beginning and 22.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:02,862 INFO L168 Benchmark]: Boogie Preprocessor took 31.98 ms. Allocated memory is still 44.6 MB. Free memory was 22.9 MB in the beginning and 21.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:02,863 INFO L168 Benchmark]: RCFGBuilder took 419.96 ms. Allocated memory is still 44.6 MB. Free memory was 21.4 MB in the beginning and 19.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:02,863 INFO L168 Benchmark]: BuchiAutomizer took 75744.17 ms. Allocated memory was 44.6 MB in the beginning and 315.1 MB in the end (delta: 270.5 MB). Free memory was 19.2 MB in the beginning and 159.7 MB in the end (delta: -140.5 MB). Peak memory consumption was 284.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:02,865 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.21 ms. Allocated memory is still 31.5 MB. Free memory was 7.7 MB in the beginning and 7.6 MB in the end (delta: 84.1 kB). Peak memory consumption was 84.1 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 258.35 ms. Allocated memory was 41.4 MB in the beginning and 44.6 MB in the end (delta: 3.1 MB). Free memory was 21.9 MB in the beginning and 24.8 MB in the end (delta: -2.9 MB). Peak memory consumption was 11.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 51.87 ms. Allocated memory is still 44.6 MB. Free memory was 24.8 MB in the beginning and 22.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 31.98 ms. Allocated memory is still 44.6 MB. Free memory was 22.9 MB in the beginning and 21.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 419.96 ms. Allocated memory is still 44.6 MB. Free memory was 21.4 MB in the beginning and 19.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 75744.17 ms. Allocated memory was 44.6 MB in the beginning and 315.1 MB in the end (delta: 270.5 MB). Free memory was 19.2 MB in the beginning and 159.7 MB in the end (delta: -140.5 MB). Peak memory consumption was 284.6 MB. Max. memory is 14.3 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...