./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 20ed64ec 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.5.800.v20200727-1323.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.2.1-dev-20ed64e [2021-08-27 14:33:37,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:33:37,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:33:37,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:33:37,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:33:37,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:33:37,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:33:37,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:33:37,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:33:37,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:33:37,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:33:37,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:33:37,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:33:37,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:33:37,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:33:37,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:33:37,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:33:37,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:33:37,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:33:37,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:33:37,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:33:37,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:33:37,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:33:37,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:33:37,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:33:37,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:33:37,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:33:37,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:33:37,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:33:37,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:33:37,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:33:37,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:33:37,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:33:37,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:33:37,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:33:37,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:33:37,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:33:37,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:33:37,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:33:37,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:33:37,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:33:37,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-08-27 14:33:37,853 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:33:37,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:33:37,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:33:37,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:33:37,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:33:37,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:33:37,855 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:33:37,856 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:33:37,856 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:33:37,856 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:33:37,856 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:33:37,857 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:33:37,857 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:33:37,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:33:37,857 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:33:37,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:33:37,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:33:37,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:33:37,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:33:37,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:33:37,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:33:37,858 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:33:37,858 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:33:37,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:33:37,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:33:37,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:33:37,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:33:37,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:33:37,858 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:33:37,859 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:33:37,859 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2021-08-27 14:33:38,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:33:38,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:33:38,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:33:38,149 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:33:38,149 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:33:38,150 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2021-08-27 14:33:38,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8cb8441/d9dd40c5320b423c919abd1f8bc5ba53/FLAG3caee2cf8 [2021-08-27 14:33:38,544 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:33:38,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2021-08-27 14:33:38,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8cb8441/d9dd40c5320b423c919abd1f8bc5ba53/FLAG3caee2cf8 [2021-08-27 14:33:38,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8cb8441/d9dd40c5320b423c919abd1f8bc5ba53 [2021-08-27 14:33:38,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:33:38,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:33:38,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:33:38,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:33:38,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:33:38,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@351ad94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38, skipping insertion in model container [2021-08-27 14:33:38,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:33:38,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:33:38,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:33:38,685 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:33:38,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:33:38,749 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:33:38,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38 WrapperNode [2021-08-27 14:33:38,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:33:38,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:33:38,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:33:38,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:33:38,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:33:38,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:33:38,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:33:38,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:33:38,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:33:38,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:33:38,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:33:38,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:33:38,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (1/1) ... [2021-08-27 14:33:38,847 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:38,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:38,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:38,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 14:33:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 14:33:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2021-08-27 14:33:38,912 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2021-08-27 14:33:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 14:33:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:33:38,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:33:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 14:33:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 14:33:39,226 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:33:39,227 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-27 14:33:39,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:33:39 BoogieIcfgContainer [2021-08-27 14:33:39,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:33:39,230 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:33:39,230 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:33:39,232 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:33:39,233 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:33:39,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:33:38" (1/3) ... [2021-08-27 14:33:39,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@520303f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:33:39, skipping insertion in model container [2021-08-27 14:33:39,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:33:39,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:33:38" (2/3) ... [2021-08-27 14:33:39,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@520303f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:33:39, skipping insertion in model container [2021-08-27 14:33:39,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:33:39,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:33:39" (3/3) ... [2021-08-27 14:33:39,236 INFO L389 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2021-08-27 14:33:39,277 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:33:39,277 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:33:39,277 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:33:39,277 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:33:39,278 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:33:39,278 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:33:39,278 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:33:39,278 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:33:39,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 14:33:39,309 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-27 14:33:39,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:39,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:39,313 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-08-27 14:33:39,313 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:33:39,313 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:33:39,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 14:33:39,318 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-27 14:33:39,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:39,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:39,319 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-08-27 14:33:39,319 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:33:39,326 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#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; 16#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 11#L40-3true [2021-08-27 14:33:39,327 INFO L793 eck$LassoCheckResult]: Loop: 11#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; 12#L40-2true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11#L40-3true [2021-08-27 14:33:39,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:39,332 INFO L82 PathProgramCache]: Analyzing trace with hash 88447, now seen corresponding path program 1 times [2021-08-27 14:33:39,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:39,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791814307] [2021-08-27 14:33:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:39,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:39,403 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:39,436 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:39,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:39,438 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2021-08-27 14:33:39,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:39,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073212095] [2021-08-27 14:33:39,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:39,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:39,454 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:39,470 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:39,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:39,472 INFO L82 PathProgramCache]: Analyzing trace with hash 84999937, now seen corresponding path program 1 times [2021-08-27 14:33:39,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:39,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141114773] [2021-08-27 14:33:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:39,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:39,495 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:39,512 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:39,833 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:33:39,834 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:33:39,837 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:33:39,837 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:33:39,837 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:33:39,837 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:39,837 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:33:39,837 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:33:39,837 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2021-08-27 14:33:39,838 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:33:39,838 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:33:39,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:39,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:39,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:39,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:39,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:39,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:39,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:39,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:40,155 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:33:40,161 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:33:40,163 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:40,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:40,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:40,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 14:33:40,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:40,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:40,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:40,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:40,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:40,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:40,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:40,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:40,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:40,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:40,202 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:40,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:40,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:40,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 14:33:40,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:40,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:40,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:40,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:40,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:40,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:40,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:40,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:40,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:40,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-08-27 14:33:40,241 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:40,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:40,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:40,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 14:33:40,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:40,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:40,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:40,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:40,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:40,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:40,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:40,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:40,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:40,288 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:40,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:40,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:40,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 14:33:40,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:40,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:40,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:40,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:40,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:40,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:40,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:40,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:40,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:40,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:40,343 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:40,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:40,344 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:40,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 14:33:40,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:40,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:40,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:40,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:40,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:40,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:40,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:40,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:40,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:40,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:40,370 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:40,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:40,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:40,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 14:33:40,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:40,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:40,379 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-08-27 14:33:40,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:40,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:40,382 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-08-27 14:33:40,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:40,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:40,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:40,414 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:40,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:40,415 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:40,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 14:33:40,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:40,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:40,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:40,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:40,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:40,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:40,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:40,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:40,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:40,454 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:40,455 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:40,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 14:33:40,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:40,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:40,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:40,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:40,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:40,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:40,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:40,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:40,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:40,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-08-27 14:33:40,486 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:40,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:40,487 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:40,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 14:33:40,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:40,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:40,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:40,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:40,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:40,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:40,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:40,524 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:33:40,535 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-08-27 14:33:40,535 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-08-27 14:33:40,537 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:40,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:40,538 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:40,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 14:33:40,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:33:40,562 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 14:33:40,562 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:33:40,562 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~1) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [] [2021-08-27 14:33:40,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:40,585 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2021-08-27 14:33:40,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:40,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:33:40,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:40,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:33:40,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:40,689 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 [2021-08-27 14:33:40,690 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:33:40,738 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 83 transitions. Complement of second has 9 states. [2021-08-27 14:33:40,738 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 [2021-08-27 14:33:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:33:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2021-08-27 14:33:40,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 2 letters. [2021-08-27 14:33:40,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:40,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2021-08-27 14:33:40,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:40,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 4 letters. [2021-08-27 14:33:40,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:40,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2021-08-27 14:33:40,752 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-27 14:33:40,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 26 states and 37 transitions. [2021-08-27 14:33:40,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-08-27 14:33:40,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-27 14:33:40,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2021-08-27 14:33:40,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:33:40,760 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2021-08-27 14:33:40,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2021-08-27 14:33:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-08-27 14:33:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 14:33:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2021-08-27 14:33:40,783 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2021-08-27 14:33:40,783 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2021-08-27 14:33:40,783 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:33:40,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2021-08-27 14:33:40,784 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-27 14:33:40,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:40,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:40,785 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 14:33:40,785 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:33:40,785 INFO L791 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 147#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; 148#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 150#L40-3 assume !(main_~i~1 < main_~n~0); 138#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 143#merge_sortENTRY [2021-08-27 14:33:40,785 INFO L793 eck$LassoCheckResult]: Loop: 143#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 144#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 139#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 143#merge_sortENTRY [2021-08-27 14:33:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:40,786 INFO L82 PathProgramCache]: Analyzing trace with hash 84999888, now seen corresponding path program 1 times [2021-08-27 14:33:40,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:40,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626148403] [2021-08-27 14:33:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:40,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:40,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:33:40,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626148403] [2021-08-27 14:33:40,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626148403] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:33:40,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:33:40,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:33:40,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958114247] [2021-08-27 14:33:40,849 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:33:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2021-08-27 14:33:40,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:40,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760539462] [2021-08-27 14:33:40,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:40,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:40,861 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:40,874 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:40,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:41,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:33:41,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:33:41,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:33:41,158 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 15 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:33:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:33:41,175 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2021-08-27 14:33:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:33:41,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2021-08-27 14:33:41,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-27 14:33:41,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2021-08-27 14:33:41,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-27 14:33:41,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-27 14:33:41,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2021-08-27 14:33:41,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:33:41,179 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-08-27 14:33:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2021-08-27 14:33:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-08-27 14:33:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 14:33:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-08-27 14:33:41,182 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-08-27 14:33:41,182 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-08-27 14:33:41,182 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:33:41,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2021-08-27 14:33:41,183 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-27 14:33:41,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:41,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:41,184 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:41,184 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:33:41,184 INFO L791 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 206#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; 207#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;havoc 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); 198#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 202#merge_sortENTRY [2021-08-27 14:33:41,184 INFO L793 eck$LassoCheckResult]: Loop: 202#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 203#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 196#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 202#merge_sortENTRY [2021-08-27 14:33:41,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:41,184 INFO L82 PathProgramCache]: Analyzing trace with hash 80563154, now seen corresponding path program 1 times [2021-08-27 14:33:41,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:41,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693734463] [2021-08-27 14:33:41,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:41,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:41,197 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:41,218 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:41,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:41,218 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 2 times [2021-08-27 14:33:41,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:41,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103035271] [2021-08-27 14:33:41,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:41,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:41,222 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:41,228 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:41,229 INFO L82 PathProgramCache]: Analyzing trace with hash -829797441, now seen corresponding path program 1 times [2021-08-27 14:33:41,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:41,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810468133] [2021-08-27 14:33:41,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:41,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:41,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:33:41,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810468133] [2021-08-27 14:33:41,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810468133] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:41,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084707259] [2021-08-27 14:33:41,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:41,339 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:33:41,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:41,340 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:33:41,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 14:33:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:41,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:33:41,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:41,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084707259] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:41,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:33:41,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 14:33:41,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717697310] [2021-08-27 14:33:41,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:33:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 14:33:41,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 14:33:41,692 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:33:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:33:41,736 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2021-08-27 14:33:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 14:33:41,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2021-08-27 14:33:41,737 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-27 14:33:41,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2021-08-27 14:33:41,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-08-27 14:33:41,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-08-27 14:33:41,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2021-08-27 14:33:41,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:33:41,739 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2021-08-27 14:33:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2021-08-27 14:33:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-08-27 14:33:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 14:33:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-08-27 14:33:41,741 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-08-27 14:33:41,741 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-08-27 14:33:41,741 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:33:41,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2021-08-27 14:33:41,742 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-27 14:33:41,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:41,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:41,742 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2021-08-27 14:33:41,742 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:33:41,743 INFO L791 eck$LassoCheckResult]: Stem: 323#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 312#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; 313#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;havoc 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; 328#L40-3 assume !(main_~i~1 < main_~n~0); 303#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 308#merge_sortENTRY [2021-08-27 14:33:41,743 INFO L793 eck$LassoCheckResult]: Loop: 308#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 309#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 302#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 308#merge_sortENTRY [2021-08-27 14:33:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:41,743 INFO L82 PathProgramCache]: Analyzing trace with hash 111829076, now seen corresponding path program 2 times [2021-08-27 14:33:41,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:41,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729318690] [2021-08-27 14:33:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:41,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:41,750 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:41,759 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 3 times [2021-08-27 14:33:41,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:41,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423387155] [2021-08-27 14:33:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:41,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:41,767 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:41,779 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:41,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1394618371, now seen corresponding path program 2 times [2021-08-27 14:33:41,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:41,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973692858] [2021-08-27 14:33:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:41,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:41,793 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:41,807 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:42,311 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:33:42,312 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:33:42,312 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:33:42,312 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:33:42,312 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:33:42,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:42,312 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:33:42,312 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:33:42,312 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2021-08-27 14:33:42,312 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:33:42,312 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:33:42,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:42,752 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:33:42,752 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:33:42,752 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:42,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:42,753 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:42,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 14:33:42,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:42,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:42,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:42,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:42,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:42,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:42,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:42,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:42,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-08-27 14:33:42,791 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:42,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:42,793 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:42,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 14:33:42,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:42,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:42,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:42,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:42,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:42,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:42,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:42,832 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:33:42,842 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-08-27 14:33:42,843 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-08-27 14:33:42,843 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:42,844 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:42,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 14:33:42,845 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:33:42,851 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 14:33:42,852 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:33:42,852 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n) = 1*merge_sort_#in~n Supporting invariants [] [2021-08-27 14:33:42,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:42,869 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2021-08-27 14:33:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:42,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:33:42,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:42,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 14:33:42,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:42,999 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 [2021-08-27 14:33:42,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:33:43,035 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 12. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 58 transitions. Complement of second has 12 states. [2021-08-27 14:33:43,036 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 [2021-08-27 14:33:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:33:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-08-27 14:33:43,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2021-08-27 14:33:43,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:43,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2021-08-27 14:33:43,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:43,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2021-08-27 14:33:43,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:43,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2021-08-27 14:33:43,038 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-27 14:33:43,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 49 transitions. [2021-08-27 14:33:43,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-08-27 14:33:43,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-08-27 14:33:43,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2021-08-27 14:33:43,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:43,040 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2021-08-27 14:33:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2021-08-27 14:33:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-08-27 14:33:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 14:33:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2021-08-27 14:33:43,042 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2021-08-27 14:33:43,042 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2021-08-27 14:33:43,042 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:33:43,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2021-08-27 14:33:43,043 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-08-27 14:33:43,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:43,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:43,044 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:43,044 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:43,044 INFO L791 eck$LassoCheckResult]: Stem: 474#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 461#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; 462#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 465#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; 466#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 467#L40-3 assume !!(main_~i~1 < main_~n~0);call write~int(main_#t~nondet21, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet21; 468#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 480#L40-3 assume !(main_~i~1 < main_~n~0); 451#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 455#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 456#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 449#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 457#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 458#L24 assume ~n < 2; 463#L8 assume true; 464#merge_sortEXIT >#86#return; 450#L27-1 [2021-08-27 14:33:43,044 INFO L793 eck$LassoCheckResult]: Loop: 450#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 473#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 478#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 448#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 473#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 478#L24 assume ~n < 2; 452#L8 assume true; 481#merge_sortEXIT >#86#return; 450#L27-1 [2021-08-27 14:33:43,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:43,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744228, now seen corresponding path program 1 times [2021-08-27 14:33:43,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:43,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627456307] [2021-08-27 14:33:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:43,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:43,054 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:43,078 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 1 times [2021-08-27 14:33:43,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:43,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858336681] [2021-08-27 14:33:43,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:43,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:43,085 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:43,089 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1064649429, now seen corresponding path program 1 times [2021-08-27 14:33:43,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:43,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114802922] [2021-08-27 14:33:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:43,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:43,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 14:33:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:43,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 14:33:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 14:33:43,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:33:43,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114802922] [2021-08-27 14:33:43,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114802922] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:43,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121696645] [2021-08-27 14:33:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:43,268 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:33:43,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:43,286 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:33:43,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-27 14:33:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:43,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 14:33:43,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:43,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121696645] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:43,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:33:43,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2021-08-27 14:33:43,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657410186] [2021-08-27 14:33:43,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:33:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 14:33:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-08-27 14:33:43,805 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 14:33:44,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:33:44,075 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2021-08-27 14:33:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 14:33:44,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 89 transitions. [2021-08-27 14:33:44,077 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2021-08-27 14:33:44,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 67 states and 85 transitions. [2021-08-27 14:33:44,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2021-08-27 14:33:44,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2021-08-27 14:33:44,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 85 transitions. [2021-08-27 14:33:44,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:44,079 INFO L681 BuchiCegarLoop]: Abstraction has 67 states and 85 transitions. [2021-08-27 14:33:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 85 transitions. [2021-08-27 14:33:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2021-08-27 14:33:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-27 14:33:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2021-08-27 14:33:44,083 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2021-08-27 14:33:44,083 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2021-08-27 14:33:44,083 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:33:44,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2021-08-27 14:33:44,084 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2021-08-27 14:33:44,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:44,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:44,084 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:44,084 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:44,085 INFO L791 eck$LassoCheckResult]: Stem: 696#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 683#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; 684#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 686#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; 687#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 688#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; 689#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 690#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; 711#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 710#L40-3 assume !(main_~i~1 < main_~n~0); 673#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 707#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 681#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 672#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 680#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 682#L24 assume ~n < 2; 701#L8 assume true; 695#merge_sortEXIT >#86#return; 671#L27-1 [2021-08-27 14:33:44,085 INFO L793 eck$LassoCheckResult]: Loop: 671#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 678#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 679#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 674#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 678#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 679#L24 assume ~n < 2; 729#L8 assume true; 730#merge_sortEXIT >#86#return; 671#L27-1 [2021-08-27 14:33:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash 691173850, now seen corresponding path program 2 times [2021-08-27 14:33:44,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:44,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602954567] [2021-08-27 14:33:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:44,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:44,093 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:44,102 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:44,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:44,102 INFO L82 PathProgramCache]: Analyzing trace with hash -313790022, now seen corresponding path program 2 times [2021-08-27 14:33:44,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:44,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820941571] [2021-08-27 14:33:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:44,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:44,106 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:44,110 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -889748845, now seen corresponding path program 2 times [2021-08-27 14:33:44,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:44,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129974233] [2021-08-27 14:33:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:44,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:44,122 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:44,133 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:45,199 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:33:45,199 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:33:45,199 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:33:45,199 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:33:45,199 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:33:45,199 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,199 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:33:45,199 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:33:45,199 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso [2021-08-27 14:33:45,200 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:33:45,200 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:33:45,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:45,652 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:33:45,652 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:33:45,652 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,659 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 14:33:45,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:45,704 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,705 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 14:33:45,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-08-27 14:33:45,731 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,732 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 14:33:45,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:45,759 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,760 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 14:33:45,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-08-27 14:33:45,787 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,788 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 14:33:45,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:45,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:45,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:45,821 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,822 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 14:33:45,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:45,847 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,848 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 14:33:45,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:45,873 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,874 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 14:33:45,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-08-27 14:33:45,899 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,899 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-27 14:33:45,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-08-27 14:33:45,924 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,924 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-27 14:33:45,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-08-27 14:33:45,950 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,950 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-27 14:33:45,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:45,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-08-27 14:33:45,976 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:45,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:45,976 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:45,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-27 14:33:45,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:45,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:45,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:45,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:45,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:45,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:45,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:45,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:45,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,004 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,005 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-27 14:33:46,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,029 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,030 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-27 14:33:46,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-08-27 14:33:46,064 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,065 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-27 14:33:46,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,091 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,092 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-27 14:33:46,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,116 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,117 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-27 14:33:46,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-08-27 14:33:46,142 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,143 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 14:33:46,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,171 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,172 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-27 14:33:46,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,196 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,197 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-27 14:33:46,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-08-27 14:33:46,222 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,222 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-27 14:33:46,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-08-27 14:33:46,247 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,248 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-27 14:33:46,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-08-27 14:33:46,271 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,272 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-27 14:33:46,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-08-27 14:33:46,302 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,303 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-27 14:33:46,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:46,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:46,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-08-27 14:33:46,332 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,333 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-27 14:33:46,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,356 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,357 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-27 14:33:46,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,383 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,384 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-27 14:33:46,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-08-27 14:33:46,408 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,409 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-27 14:33:46,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,433 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,434 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-27 14:33:46,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-08-27 14:33:46,458 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,459 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-27 14:33:46,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-08-27 14:33:46,484 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,485 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-08-27 14:33:46,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-08-27 14:33:46,509 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,510 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-08-27 14:33:46,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-08-27 14:33:46,535 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,536 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-08-27 14:33:46,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,560 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,561 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-08-27 14:33:46,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-08-27 14:33:46,585 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,586 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-08-27 14:33:46,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-08-27 14:33:46,611 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,612 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-08-27 14:33:46,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:46,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:46,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:46,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-08-27 14:33:46,636 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,637 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-08-27 14:33:46,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,650 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-08-27 14:33:46,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,653 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-08-27 14:33:46,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:46,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-08-27 14:33:46,689 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,690 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-08-27 14:33:46,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:46,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:46,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-08-27 14:33:46,724 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,725 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-08-27 14:33:46,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:46,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:46,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:46,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-08-27 14:33:46,753 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,753 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-08-27 14:33:46,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:46,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:46,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:46,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:46,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:46,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:46,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:46,803 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:33:46,823 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-08-27 14:33:46,824 INFO L444 ModelExtractionUtils]: 0 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-08-27 14:33:46,824 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:46,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:46,825 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:46,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-08-27 14:33:46,826 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:33:46,842 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-08-27 14:33:46,842 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:33:46,842 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~a.offset, merge_sort_~m~0) = -1*merge_sort_~a.offset - 4*merge_sort_~m~0 + 5 Supporting invariants [-1*merge_sort_~a.offset - 4*merge_sort_~n + 12 >= 0] [2021-08-27 14:33:46,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:46,862 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2021-08-27 14:33:46,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:46,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 14:33:46,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:47,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-08-27 14:33:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:47,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 14:33:47,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:47,311 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 [2021-08-27 14:33:47,312 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23 Second operand has 14 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 14:33:47,677 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 23. Second operand has 14 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 337 states and 467 transitions. Complement of second has 44 states. [2021-08-27 14:33:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 10 stem states 4 non-accepting loop states 2 accepting loop states [2021-08-27 14:33:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 14:33:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 85 transitions. [2021-08-27 14:33:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 85 transitions. Stem has 18 letters. Loop has 8 letters. [2021-08-27 14:33:47,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 85 transitions. Stem has 26 letters. Loop has 8 letters. [2021-08-27 14:33:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 85 transitions. Stem has 18 letters. Loop has 16 letters. [2021-08-27 14:33:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:47,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 467 transitions. [2021-08-27 14:33:47,684 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2021-08-27 14:33:47,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 248 states and 347 transitions. [2021-08-27 14:33:47,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2021-08-27 14:33:47,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2021-08-27 14:33:47,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 347 transitions. [2021-08-27 14:33:47,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:47,689 INFO L681 BuchiCegarLoop]: Abstraction has 248 states and 347 transitions. [2021-08-27 14:33:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 347 transitions. [2021-08-27 14:33:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 218. [2021-08-27 14:33:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 177 states have (on average 1.310734463276836) internal successors, (232), 179 states have internal predecessors, (232), 26 states have call successors, (29), 17 states have call predecessors, (29), 15 states have return successors, (32), 21 states have call predecessors, (32), 23 states have call successors, (32) [2021-08-27 14:33:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 293 transitions. [2021-08-27 14:33:47,701 INFO L704 BuchiCegarLoop]: Abstraction has 218 states and 293 transitions. [2021-08-27 14:33:47,701 INFO L587 BuchiCegarLoop]: Abstraction has 218 states and 293 transitions. [2021-08-27 14:33:47,701 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:33:47,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 293 transitions. [2021-08-27 14:33:47,702 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2021-08-27 14:33:47,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:47,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:47,703 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:47,703 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:33:47,704 INFO L791 eck$LassoCheckResult]: Stem: 1306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1276#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; 1277#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1280#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; 1281#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1285#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; 1350#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1349#L40-3 assume !(main_~i~1 < main_~n~0); 1291#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1323#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1358#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1299#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1300#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1369#L24 assume ~n < 2; 1368#L8 assume true; 1366#merge_sortEXIT >#86#return; 1367#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1373#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1377#L24 assume ~n < 2; 1375#L8 assume true; 1372#merge_sortEXIT >#88#return; 1290#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1292#L11-3 [2021-08-27 14:33:47,704 INFO L793 eck$LassoCheckResult]: Loop: 1292#L11-3 assume !!(merge_~k~0 < merge_~n); 1308#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; 1324#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 1321#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1292#L11-3 [2021-08-27 14:33:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 1 times [2021-08-27 14:33:47,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:47,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653076686] [2021-08-27 14:33:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:47,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:47,712 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:47,720 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2021-08-27 14:33:47,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:47,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073808998] [2021-08-27 14:33:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:47,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:47,723 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:47,726 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash -782974256, now seen corresponding path program 1 times [2021-08-27 14:33:47,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:47,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685902366] [2021-08-27 14:33:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:47,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:47,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 14:33:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:47,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 14:33:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-27 14:33:47,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:33:47,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685902366] [2021-08-27 14:33:47,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685902366] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:33:47,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:33:47,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 14:33:47,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549719739] [2021-08-27 14:33:47,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:33:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:33:47,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:33:47,885 INFO L87 Difference]: Start difference. First operand 218 states and 293 transitions. cyclomatic complexity: 99 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:33:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:33:47,990 INFO L93 Difference]: Finished difference Result 350 states and 491 transitions. [2021-08-27 14:33:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 14:33:47,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 491 transitions. [2021-08-27 14:33:47,995 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 136 [2021-08-27 14:33:47,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 350 states and 491 transitions. [2021-08-27 14:33:47,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2021-08-27 14:33:47,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2021-08-27 14:33:47,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 491 transitions. [2021-08-27 14:33:47,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:47,999 INFO L681 BuchiCegarLoop]: Abstraction has 350 states and 491 transitions. [2021-08-27 14:33:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 491 transitions. [2021-08-27 14:33:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 272. [2021-08-27 14:33:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 231 states have (on average 1.277056277056277) internal successors, (295), 233 states have internal predecessors, (295), 26 states have call successors, (29), 17 states have call predecessors, (29), 15 states have return successors, (32), 21 states have call predecessors, (32), 23 states have call successors, (32) [2021-08-27 14:33:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 356 transitions. [2021-08-27 14:33:48,011 INFO L704 BuchiCegarLoop]: Abstraction has 272 states and 356 transitions. [2021-08-27 14:33:48,011 INFO L587 BuchiCegarLoop]: Abstraction has 272 states and 356 transitions. [2021-08-27 14:33:48,011 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:33:48,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 272 states and 356 transitions. [2021-08-27 14:33:48,013 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2021-08-27 14:33:48,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:48,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:48,013 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:48,013 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:48,014 INFO L791 eck$LassoCheckResult]: Stem: 1901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1872#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; 1873#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 1876#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; 1877#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1878#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; 1879#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1926#L40-3 assume !(main_~i~1 < main_~n~0); 1883#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 1920#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1969#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 1967#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 1968#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1975#L24 assume ~n < 2; 1974#L8 assume true; 1973#merge_sortEXIT >#86#return; 1915#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 1966#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 1914#L24 assume ~n < 2; 1916#L8 assume true; 2091#merge_sortEXIT >#88#return; 1882#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 1885#L11-3 [2021-08-27 14:33:48,014 INFO L793 eck$LassoCheckResult]: Loop: 1885#L11-3 assume !!(merge_~k~0 < merge_~n); 1903#L12 assume !(merge_~j~0 == merge_~n); 2106#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); 1896#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; 1898#L14-2 merge_#t~ite14 := merge_#t~ite13; 1921#L13-2 merge_#t~ite15 := merge_#t~ite14; 1922#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 1917#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 1885#L11-3 [2021-08-27 14:33:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:48,014 INFO L82 PathProgramCache]: Analyzing trace with hash 340719275, now seen corresponding path program 2 times [2021-08-27 14:33:48,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:48,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751655939] [2021-08-27 14:33:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:48,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:48,021 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:48,029 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:48,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:48,029 INFO L82 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2021-08-27 14:33:48,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:48,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628718088] [2021-08-27 14:33:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:48,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:48,033 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:48,036 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:48,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:48,037 INFO L82 PathProgramCache]: Analyzing trace with hash 389830265, now seen corresponding path program 1 times [2021-08-27 14:33:48,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:48,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518488006] [2021-08-27 14:33:48,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:48,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:48,048 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:48,061 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:49,685 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:33:49,685 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:33:49,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:33:49,686 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:33:49,686 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:33:49,686 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:49,686 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:33:49,686 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:33:49,686 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso [2021-08-27 14:33:49,686 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:33:49,686 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:33:49,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:49,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:49,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:49,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:50,886 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:33:50,886 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:33:50,886 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:50,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:50,889 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:50,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-08-27 14:33:50,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:50,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:50,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:50,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:50,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:50,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:50,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:50,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:50,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:50,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:50,919 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:50,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:50,920 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:50,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-08-27 14:33:50,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:50,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:50,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:50,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:50,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:50,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:50,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:50,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:50,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:50,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-08-27 14:33:50,944 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:50,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:50,945 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:50,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:50,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-08-27 14:33:50,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:50,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:33:50,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:50,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:50,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:50,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:33:50,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:33:50,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:50,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-08-27 14:33:50,975 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:50,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:50,976 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:50,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-08-27 14:33:50,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:50,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:50,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:50,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:50,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:50,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:50,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:50,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:51,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-08-27 14:33:51,006 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:51,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:51,006 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:51,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-08-27 14:33:51,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:51,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:51,014 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2021-08-27 14:33:51,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:51,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:51,029 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2021-08-27 14:33:51,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:51,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:51,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-08-27 14:33:51,057 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:51,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:51,058 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:51,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-08-27 14:33:51,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:51,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:51,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:51,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:33:51,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:51,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:33:51,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:33:51,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:33:51,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-08-27 14:33:51,084 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:51,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:51,084 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:51,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-08-27 14:33:51,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:33:51,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:33:51,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:33:51,093 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2021-08-27 14:33:51,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:33:51,177 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2021-08-27 14:33:51,178 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2021-08-27 14:33:51,652 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:33:52,528 INFO L443 ModelExtractionUtils]: Simplification made 44 calls to the SMT solver. [2021-08-27 14:33:52,528 INFO L444 ModelExtractionUtils]: 91 out of 190 variables were initially zero. Simplification set additionally 95 variables to zero. [2021-08-27 14:33:52,532 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:52,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:52,533 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:33:52,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-08-27 14:33:52,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:33:52,545 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2021-08-27 14:33:52,545 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:33:52,545 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~x~0.offset, v_rep(select #length merge_sort_merge_~x~0.base)_1, merge_sort_merge_~k~0) = -1*merge_sort_merge_~x~0.offset + 1*v_rep(select #length merge_sort_merge_~x~0.base)_1 - 4*merge_sort_merge_~k~0 Supporting invariants [] [2021-08-27 14:33:52,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-08-27 14:33:52,584 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2021-08-27 14:33:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:52,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 14:33:52,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:52,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2021-08-27 14:33:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:52,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:33:52,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:52,875 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 [2021-08-27 14:33:52,876 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 272 states and 356 transitions. cyclomatic complexity: 108 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:33:52,938 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 272 states and 356 transitions. cyclomatic complexity: 108. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 686 states and 943 transitions. Complement of second has 14 states. [2021-08-27 14:33:52,939 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 [2021-08-27 14:33:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:33:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2021-08-27 14:33:52,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 22 letters. Loop has 8 letters. [2021-08-27 14:33:52,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:52,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 30 letters. Loop has 8 letters. [2021-08-27 14:33:52,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:52,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 22 letters. Loop has 16 letters. [2021-08-27 14:33:52,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:33:52,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686 states and 943 transitions. [2021-08-27 14:33:52,954 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 124 [2021-08-27 14:33:52,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 686 states to 506 states and 697 transitions. [2021-08-27 14:33:52,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2021-08-27 14:33:52,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2021-08-27 14:33:52,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 506 states and 697 transitions. [2021-08-27 14:33:52,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:52,965 INFO L681 BuchiCegarLoop]: Abstraction has 506 states and 697 transitions. [2021-08-27 14:33:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 697 transitions. [2021-08-27 14:33:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 475. [2021-08-27 14:33:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 407 states have (on average 1.2972972972972974) internal successors, (528), 413 states have internal predecessors, (528), 41 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (84), 38 states have call predecessors, (84), 38 states have call successors, (84) [2021-08-27 14:33:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 657 transitions. [2021-08-27 14:33:52,994 INFO L704 BuchiCegarLoop]: Abstraction has 475 states and 657 transitions. [2021-08-27 14:33:52,994 INFO L587 BuchiCegarLoop]: Abstraction has 475 states and 657 transitions. [2021-08-27 14:33:52,994 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:33:52,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 475 states and 657 transitions. [2021-08-27 14:33:52,996 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 118 [2021-08-27 14:33:52,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:52,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:52,998 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:52,998 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:33:52,998 INFO L791 eck$LassoCheckResult]: Stem: 3021#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2981#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; 2982#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 2993#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; 2994#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2995#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; 2996#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3077#L40-3 assume !(main_~i~1 < main_~n~0); 2962#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 3043#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3125#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 3013#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 3014#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3254#L24 assume ~n < 2; 3251#L8 assume true; 3248#merge_sortEXIT >#86#return; 3010#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 3029#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 3036#L24 assume ~n < 2; 3037#L8 assume true; 3009#merge_sortEXIT >#88#return; 3011#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 3392#L11-3 assume !(merge_~k~0 < merge_~n); 3391#L11-4 merge_~i~0 := 0; 3031#L17-3 [2021-08-27 14:33:52,998 INFO L793 eck$LassoCheckResult]: Loop: 3031#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; 3032#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 3031#L17-3 [2021-08-27 14:33:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1013709224, now seen corresponding path program 1 times [2021-08-27 14:33:52,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:52,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284078083] [2021-08-27 14:33:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:52,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:53,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 14:33:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:53,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 14:33:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 14:33:53,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:33:53,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284078083] [2021-08-27 14:33:53,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284078083] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:53,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569277659] [2021-08-27 14:33:53,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:53,078 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:33:53,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:53,081 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:33:53,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2021-08-27 14:33:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:53,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 14:33:53,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-27 14:33:53,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569277659] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:33:53,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 14:33:53,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2021-08-27 14:33:53,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074528508] [2021-08-27 14:33:53,355 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:33:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2021-08-27 14:33:53,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:53,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014691589] [2021-08-27 14:33:53,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:53,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:53,360 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:53,361 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:53,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:33:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:33:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-27 14:33:53,415 INFO L87 Difference]: Start difference. First operand 475 states and 657 transitions. cyclomatic complexity: 223 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:33:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:33:53,445 INFO L93 Difference]: Finished difference Result 680 states and 896 transitions. [2021-08-27 14:33:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:33:53,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 680 states and 896 transitions. [2021-08-27 14:33:53,451 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 118 [2021-08-27 14:33:53,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 680 states to 680 states and 896 transitions. [2021-08-27 14:33:53,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 322 [2021-08-27 14:33:53,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2021-08-27 14:33:53,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 680 states and 896 transitions. [2021-08-27 14:33:53,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:53,463 INFO L681 BuchiCegarLoop]: Abstraction has 680 states and 896 transitions. [2021-08-27 14:33:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states and 896 transitions. [2021-08-27 14:33:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 493. [2021-08-27 14:33:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 421 states have (on average 1.2707838479809976) internal successors, (535), 431 states have internal predecessors, (535), 41 states have call successors, (45), 23 states have call predecessors, (45), 31 states have return successors, (95), 38 states have call predecessors, (95), 38 states have call successors, (95) [2021-08-27 14:33:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 675 transitions. [2021-08-27 14:33:53,479 INFO L704 BuchiCegarLoop]: Abstraction has 493 states and 675 transitions. [2021-08-27 14:33:53,479 INFO L587 BuchiCegarLoop]: Abstraction has 493 states and 675 transitions. [2021-08-27 14:33:53,479 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:33:53,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 493 states and 675 transitions. [2021-08-27 14:33:53,481 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 118 [2021-08-27 14:33:53,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:53,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:53,482 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:53,482 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:33:53,483 INFO L791 eck$LassoCheckResult]: Stem: 4270#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4239#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; 4240#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 4246#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; 4247#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4248#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; 4249#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4310#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; 4331#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4330#L40-3 assume !(main_~i~1 < main_~n~0); 4273#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 4328#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4326#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4265#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4324#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4329#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4264#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4267#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4333#L24 assume ~n < 2; 4419#L8 assume true; 4406#merge_sortEXIT >#86#return; 4210#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 4452#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4486#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4213#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4611#merge_sortENTRY [2021-08-27 14:33:53,483 INFO L793 eck$LassoCheckResult]: Loop: 4611#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 4612#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 4217#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 4611#merge_sortENTRY [2021-08-27 14:33:53,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:53,483 INFO L82 PathProgramCache]: Analyzing trace with hash 384755823, now seen corresponding path program 3 times [2021-08-27 14:33:53,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:53,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897184135] [2021-08-27 14:33:53,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:53,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 14:33:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:33:53,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:33:53,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897184135] [2021-08-27 14:33:53,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897184135] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:53,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729252536] [2021-08-27 14:33:53,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:33:53,572 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:33:53,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:53,577 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:33:53,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2021-08-27 14:33:53,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 14:33:53,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:33:53,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 14:33:53,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 14:33:53,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729252536] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:53,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:33:53,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2021-08-27 14:33:53,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809476704] [2021-08-27 14:33:53,840 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:33:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 4 times [2021-08-27 14:33:53,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:53,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344078485] [2021-08-27 14:33:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:53,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:53,846 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:53,851 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:53,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:33:53,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 14:33:53,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-08-27 14:33:53,967 INFO L87 Difference]: Start difference. First operand 493 states and 675 transitions. cyclomatic complexity: 223 Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:33:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:33:54,163 INFO L93 Difference]: Finished difference Result 549 states and 751 transitions. [2021-08-27 14:33:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 14:33:54,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 751 transitions. [2021-08-27 14:33:54,167 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 138 [2021-08-27 14:33:54,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 545 states and 747 transitions. [2021-08-27 14:33:54,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2021-08-27 14:33:54,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2021-08-27 14:33:54,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 545 states and 747 transitions. [2021-08-27 14:33:54,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:54,171 INFO L681 BuchiCegarLoop]: Abstraction has 545 states and 747 transitions. [2021-08-27 14:33:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states and 747 transitions. [2021-08-27 14:33:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 509. [2021-08-27 14:33:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 437 states have (on average 1.2700228832951945) internal successors, (555), 446 states have internal predecessors, (555), 41 states have call successors, (45), 23 states have call predecessors, (45), 31 states have return successors, (93), 39 states have call predecessors, (93), 38 states have call successors, (93) [2021-08-27 14:33:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 693 transitions. [2021-08-27 14:33:54,182 INFO L704 BuchiCegarLoop]: Abstraction has 509 states and 693 transitions. [2021-08-27 14:33:54,182 INFO L587 BuchiCegarLoop]: Abstraction has 509 states and 693 transitions. [2021-08-27 14:33:54,182 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 14:33:54,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 509 states and 693 transitions. [2021-08-27 14:33:54,184 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 132 [2021-08-27 14:33:54,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:54,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:54,184 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:54,184 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:33:54,185 INFO L791 eck$LassoCheckResult]: Stem: 5410#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5384#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; 5385#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 5389#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; 5390#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5391#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; 5392#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5448#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; 5472#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5446#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; 5447#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 5471#L40-3 assume !(main_~i~1 < main_~n~0); 5365#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 5469#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5470#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 5406#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 5407#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5468#L24 assume ~n < 2; 5570#L8 assume true; 5522#merge_sortEXIT >#86#return; 5523#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 5587#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5589#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 5533#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 5634#merge_sortENTRY [2021-08-27 14:33:54,185 INFO L793 eck$LassoCheckResult]: Loop: 5634#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 5639#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 5530#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 5634#merge_sortENTRY [2021-08-27 14:33:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:54,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1331732786, now seen corresponding path program 4 times [2021-08-27 14:33:54,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:54,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554007694] [2021-08-27 14:33:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:54,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:54,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 14:33:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:54,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:33:54,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554007694] [2021-08-27 14:33:54,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554007694] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:54,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440123011] [2021-08-27 14:33:54,306 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:33:54,306 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:33:54,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:54,315 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:33:54,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2021-08-27 14:33:54,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:33:54,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:33:54,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 14:33:54,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:54,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440123011] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:54,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:33:54,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 16 [2021-08-27 14:33:54,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98599013] [2021-08-27 14:33:54,598 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:33:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:54,599 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 5 times [2021-08-27 14:33:54,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:54,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653060149] [2021-08-27 14:33:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:54,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:54,607 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:54,611 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:54,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:33:54,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 14:33:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-08-27 14:33:54,747 INFO L87 Difference]: Start difference. First operand 509 states and 693 transitions. cyclomatic complexity: 226 Second operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 14:33:55,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:33:55,027 INFO L93 Difference]: Finished difference Result 544 states and 744 transitions. [2021-08-27 14:33:55,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 14:33:55,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 544 states and 744 transitions. [2021-08-27 14:33:55,032 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 150 [2021-08-27 14:33:55,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 544 states to 541 states and 741 transitions. [2021-08-27 14:33:55,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2021-08-27 14:33:55,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2021-08-27 14:33:55,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 541 states and 741 transitions. [2021-08-27 14:33:55,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:55,037 INFO L681 BuchiCegarLoop]: Abstraction has 541 states and 741 transitions. [2021-08-27 14:33:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states and 741 transitions. [2021-08-27 14:33:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 509. [2021-08-27 14:33:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 437 states have (on average 1.2700228832951945) internal successors, (555), 446 states have internal predecessors, (555), 41 states have call successors, (45), 23 states have call predecessors, (45), 31 states have return successors, (91), 39 states have call predecessors, (91), 38 states have call successors, (91) [2021-08-27 14:33:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 691 transitions. [2021-08-27 14:33:55,049 INFO L704 BuchiCegarLoop]: Abstraction has 509 states and 691 transitions. [2021-08-27 14:33:55,049 INFO L587 BuchiCegarLoop]: Abstraction has 509 states and 691 transitions. [2021-08-27 14:33:55,049 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 14:33:55,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 509 states and 691 transitions. [2021-08-27 14:33:55,051 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 132 [2021-08-27 14:33:55,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:55,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:55,053 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:33:55,053 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:33:55,054 INFO L791 eck$LassoCheckResult]: Stem: 6568#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6542#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; 6543#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 6548#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; 6549#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6550#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; 6551#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6600#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; 6637#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 6636#L40-3 assume !(main_~i~1 < main_~n~0); 6519#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 6635#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6633#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6630#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6631#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6634#L24 assume ~n < 2; 6632#L8 assume true; 6629#merge_sortEXIT >#86#return; 6523#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 6627#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6628#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6529#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6711#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6712#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6744#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6750#merge_sortENTRY [2021-08-27 14:33:55,054 INFO L793 eck$LassoCheckResult]: Loop: 6750#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 6753#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 6747#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 6750#merge_sortENTRY [2021-08-27 14:33:55,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:55,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1495319133, now seen corresponding path program 5 times [2021-08-27 14:33:55,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:55,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136583564] [2021-08-27 14:33:55,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:55,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:55,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 14:33:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:33:55,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:33:55,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136583564] [2021-08-27 14:33:55,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136583564] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:55,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714576353] [2021-08-27 14:33:55,225 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:33:55,226 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:33:55,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:55,236 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:33:55,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2021-08-27 14:33:55,457 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-08-27 14:33:55,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:33:55,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 14:33:55,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-27 14:33:55,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714576353] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:55,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:33:55,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 19 [2021-08-27 14:33:55,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268774785] [2021-08-27 14:33:55,595 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:33:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 6 times [2021-08-27 14:33:55,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:55,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487081889] [2021-08-27 14:33:55,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:55,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:55,599 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:55,601 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:55,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:33:55,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 14:33:55,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-08-27 14:33:55,724 INFO L87 Difference]: Start difference. First operand 509 states and 691 transitions. cyclomatic complexity: 224 Second operand has 19 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 14:33:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:33:56,145 INFO L93 Difference]: Finished difference Result 282 states and 358 transitions. [2021-08-27 14:33:56,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 14:33:56,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 282 states and 358 transitions. [2021-08-27 14:33:56,147 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 92 [2021-08-27 14:33:56,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 282 states to 275 states and 351 transitions. [2021-08-27 14:33:56,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2021-08-27 14:33:56,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2021-08-27 14:33:56,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 351 transitions. [2021-08-27 14:33:56,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:56,149 INFO L681 BuchiCegarLoop]: Abstraction has 275 states and 351 transitions. [2021-08-27 14:33:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 351 transitions. [2021-08-27 14:33:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 230. [2021-08-27 14:33:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 195 states have (on average 1.241025641025641) internal successors, (242), 197 states have internal predecessors, (242), 20 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (28), 16 states have call predecessors, (28), 17 states have call successors, (28) [2021-08-27 14:33:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 291 transitions. [2021-08-27 14:33:56,153 INFO L704 BuchiCegarLoop]: Abstraction has 230 states and 291 transitions. [2021-08-27 14:33:56,153 INFO L587 BuchiCegarLoop]: Abstraction has 230 states and 291 transitions. [2021-08-27 14:33:56,153 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 14:33:56,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 291 transitions. [2021-08-27 14:33:56,154 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 58 [2021-08-27 14:33:56,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:56,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:56,155 INFO L842 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] [2021-08-27 14:33:56,155 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:33:56,155 INFO L791 eck$LassoCheckResult]: Stem: 7483#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7465#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; 7466#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 7468#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; 7469#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7470#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; 7471#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 7509#L40-3 assume !(main_~i~1 < main_~n~0); 7485#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 7498#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7516#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 7621#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 7622#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7626#L24 assume ~n < 2; 7625#L8 assume true; 7620#merge_sortEXIT >#86#return; 7616#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 7617#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 7624#L24 assume ~n < 2; 7619#L8 assume true; 7615#merge_sortEXIT >#88#return; 7613#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 7612#L11-3 assume !!(merge_~k~0 < merge_~n); 7487#L12 assume !(merge_~j~0 == merge_~n); 7607#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; 7604#L13-2 merge_#t~ite15 := merge_#t~ite14; 7605#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 7599#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 7600#L11-3 assume !(merge_~k~0 < merge_~n); 7486#L11-4 merge_~i~0 := 0; 7489#L17-3 [2021-08-27 14:33:56,155 INFO L793 eck$LassoCheckResult]: Loop: 7489#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; 7488#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 7489#L17-3 [2021-08-27 14:33:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:56,155 INFO L82 PathProgramCache]: Analyzing trace with hash 336388346, now seen corresponding path program 1 times [2021-08-27 14:33:56,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:56,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962054424] [2021-08-27 14:33:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:56,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 14:33:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:56,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 14:33:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-27 14:33:56,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:33:56,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962054424] [2021-08-27 14:33:56,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962054424] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:33:56,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:33:56,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 14:33:56,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316618083] [2021-08-27 14:33:56,226 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:33:56,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:56,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2021-08-27 14:33:56,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:56,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223643602] [2021-08-27 14:33:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:56,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:56,229 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:56,230 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:56,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:33:56,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:33:56,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:33:56,283 INFO L87 Difference]: Start difference. First operand 230 states and 291 transitions. cyclomatic complexity: 77 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:33:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:33:56,360 INFO L93 Difference]: Finished difference Result 285 states and 360 transitions. [2021-08-27 14:33:56,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 14:33:56,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 360 transitions. [2021-08-27 14:33:56,363 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 76 [2021-08-27 14:33:56,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 360 transitions. [2021-08-27 14:33:56,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2021-08-27 14:33:56,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2021-08-27 14:33:56,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 360 transitions. [2021-08-27 14:33:56,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:56,365 INFO L681 BuchiCegarLoop]: Abstraction has 285 states and 360 transitions. [2021-08-27 14:33:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 360 transitions. [2021-08-27 14:33:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2021-08-27 14:33:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 244 states have (on average 1.25) internal successors, (305), 246 states have internal predecessors, (305), 20 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (28), 16 states have call predecessors, (28), 17 states have call successors, (28) [2021-08-27 14:33:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 354 transitions. [2021-08-27 14:33:56,369 INFO L704 BuchiCegarLoop]: Abstraction has 279 states and 354 transitions. [2021-08-27 14:33:56,369 INFO L587 BuchiCegarLoop]: Abstraction has 279 states and 354 transitions. [2021-08-27 14:33:56,369 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 14:33:56,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 354 transitions. [2021-08-27 14:33:56,370 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 76 [2021-08-27 14:33:56,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:56,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:56,371 INFO L842 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] [2021-08-27 14:33:56,371 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:33:56,371 INFO L791 eck$LassoCheckResult]: Stem: 8024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8001#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; 8002#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 8006#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; 8007#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8008#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; 8009#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8048#L40-3 assume !(main_~i~1 < main_~n~0); 7999#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 8039#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8054#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 8055#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 8207#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8210#L24 assume ~n < 2; 8164#L8 assume true; 8165#merge_sortEXIT >#86#return; 8016#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 8031#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8032#L24 assume ~n < 2; 8033#L8 assume true; 8015#merge_sortEXIT >#88#return; 8017#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 8242#L11-3 assume !!(merge_~k~0 < merge_~n); 8012#L12 assume !(merge_~j~0 == merge_~n); 7998#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); 8000#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; 8236#L14-2 merge_#t~ite14 := merge_#t~ite13; 8240#L13-2 merge_#t~ite15 := merge_#t~ite14; 8245#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 8244#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8243#L11-3 assume !(merge_~k~0 < merge_~n); 8038#L11-4 merge_~i~0 := 0; 8030#L17-3 [2021-08-27 14:33:56,371 INFO L793 eck$LassoCheckResult]: Loop: 8030#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; 8029#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 8030#L17-3 [2021-08-27 14:33:56,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:56,372 INFO L82 PathProgramCache]: Analyzing trace with hash -810277004, now seen corresponding path program 1 times [2021-08-27 14:33:56,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:56,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413951782] [2021-08-27 14:33:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:56,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:56,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 14:33:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 14:33:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 14:33:56,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:33:56,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413951782] [2021-08-27 14:33:56,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413951782] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:56,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860224259] [2021-08-27 14:33:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:56,442 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:33:56,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:33:56,481 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:33:56,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2021-08-27 14:33:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:33:56,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:33:56,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:33:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-27 14:33:56,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860224259] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:33:56,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:33:56,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 12 [2021-08-27 14:33:56,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45204254] [2021-08-27 14:33:56,818 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:33:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2021-08-27 14:33:56,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:56,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49994928] [2021-08-27 14:33:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:56,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:56,821 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:56,823 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:56,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:33:56,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 14:33:56,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 14:33:56,871 INFO L87 Difference]: Start difference. First operand 279 states and 354 transitions. cyclomatic complexity: 91 Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:33:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:33:57,107 INFO L93 Difference]: Finished difference Result 475 states and 578 transitions. [2021-08-27 14:33:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 14:33:57,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 475 states and 578 transitions. [2021-08-27 14:33:57,110 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 76 [2021-08-27 14:33:57,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 475 states to 475 states and 578 transitions. [2021-08-27 14:33:57,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2021-08-27 14:33:57,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2021-08-27 14:33:57,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 475 states and 578 transitions. [2021-08-27 14:33:57,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:33:57,113 INFO L681 BuchiCegarLoop]: Abstraction has 475 states and 578 transitions. [2021-08-27 14:33:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states and 578 transitions. [2021-08-27 14:33:57,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 363. [2021-08-27 14:33:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 328 states have (on average 1.2073170731707317) internal successors, (396), 330 states have internal predecessors, (396), 20 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (28), 16 states have call predecessors, (28), 17 states have call successors, (28) [2021-08-27 14:33:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 445 transitions. [2021-08-27 14:33:57,119 INFO L704 BuchiCegarLoop]: Abstraction has 363 states and 445 transitions. [2021-08-27 14:33:57,119 INFO L587 BuchiCegarLoop]: Abstraction has 363 states and 445 transitions. [2021-08-27 14:33:57,119 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 14:33:57,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 363 states and 445 transitions. [2021-08-27 14:33:57,120 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 76 [2021-08-27 14:33:57,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:33:57,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:33:57,121 INFO L842 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] [2021-08-27 14:33:57,121 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:33:57,121 INFO L791 eck$LassoCheckResult]: Stem: 8919#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8895#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; 8896#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 8900#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; 8901#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8902#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; 8903#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 8904#L40-3 assume !(main_~i~1 < main_~n~0); 8926#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 8935#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 8964#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9007#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9008#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9114#L24 assume ~n < 2; 9113#L8 assume true; 9006#merge_sortEXIT >#86#return; 8898#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 9110#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9112#L24 assume ~n < 2; 8897#L8 assume true; 8899#merge_sortEXIT >#88#return; 8912#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 9109#L11-3 assume !!(merge_~k~0 < merge_~n); 9108#L12 assume !(merge_~j~0 == merge_~n); 9107#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); 9105#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; 9104#L14-2 merge_#t~ite14 := merge_#t~ite13; 9103#L13-2 merge_#t~ite15 := merge_#t~ite14; 9102#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 9101#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 9099#L11-3 assume !!(merge_~k~0 < merge_~n); 9098#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; 9094#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 8960#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 8961#L11-3 assume !(merge_~k~0 < merge_~n); 8956#L11-4 merge_~i~0 := 0; 8925#L17-3 [2021-08-27 14:33:57,121 INFO L793 eck$LassoCheckResult]: Loop: 8925#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; 8927#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 8925#L17-3 [2021-08-27 14:33:57,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash 64206937, now seen corresponding path program 1 times [2021-08-27 14:33:57,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:57,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105184948] [2021-08-27 14:33:57,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:57,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:57,131 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:57,142 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:57,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:57,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2021-08-27 14:33:57,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:57,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568043279] [2021-08-27 14:33:57,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:57,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:57,145 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:57,146 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:33:57,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1573325915, now seen corresponding path program 1 times [2021-08-27 14:33:57,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:33:57,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851624523] [2021-08-27 14:33:57,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:33:57,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:33:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:57,156 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:33:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:33:57,167 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:33:59,493 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:33:59,493 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:33:59,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:33:59,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:33:59,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:33:59,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:33:59,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:33:59,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:33:59,493 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration15_Lasso [2021-08-27 14:33:59,493 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:33:59,493 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:33:59,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:59,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:59,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:59,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:59,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:59,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:59,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:59,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:59,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:59,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:33:59,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:00,693 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:34:00,693 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:34:00,693 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,694 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-08-27 14:34:00,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:00,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:00,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:00,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-08-27 14:34:00,718 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,718 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-08-27 14:34:00,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:00,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:00,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:00,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-08-27 14:34:00,743 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,744 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-08-27 14:34:00,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:00,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:00,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:00,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-08-27 14:34:00,768 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,769 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-08-27 14:34:00,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:00,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:00,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:00,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-08-27 14:34:00,795 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,796 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-08-27 14:34:00,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:00,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:00,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:00,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-08-27 14:34:00,823 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,824 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-08-27 14:34:00,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:00,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:00,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:00,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-08-27 14:34:00,847 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,848 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-08-27 14:34:00,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:00,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:00,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:00,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-08-27 14:34:00,871 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,872 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-08-27 14:34:00,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:00,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:00,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:00,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-08-27 14:34:00,895 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,895 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-08-27 14:34:00,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:00,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:00,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:00,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-08-27 14:34:00,919 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,920 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-08-27 14:34:00,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:00,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:00,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:00,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2021-08-27 14:34:00,943 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,943 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-08-27 14:34:00,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:34:00,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:34:00,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-08-27 14:34:00,968 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,969 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:00,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-08-27 14:34:00,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:00,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:00,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:00,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:00,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:00,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:34:00,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:34:00,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:00,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-08-27 14:34:00,998 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:00,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:00,999 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:01,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-08-27 14:34:01,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:01,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:01,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:01,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:01,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:01,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:01,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:01,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:01,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:01,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-08-27 14:34:01,021 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:01,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:01,022 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:01,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-08-27 14:34:01,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:01,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:01,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:01,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:01,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:01,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:34:01,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:34:01,058 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:34:01,108 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2021-08-27 14:34:01,108 INFO L444 ModelExtractionUtils]: 10 out of 52 variables were initially zero. Simplification set additionally 38 variables to zero. [2021-08-27 14:34:01,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:01,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:01,113 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:01,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-08-27 14:34:01,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:34:01,137 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 14:34:01,137 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:34:01,137 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a.offset, v_rep(select #length merge_sort_merge_~x~0.base)_2, merge_sort_merge_~i~0) = -1*merge_sort_merge_~a.offset + 1*v_rep(select #length merge_sort_merge_~x~0.base)_2 - 4*merge_sort_merge_~i~0 Supporting invariants [] [2021-08-27 14:34:01,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2021-08-27 14:34:01,179 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2021-08-27 14:34:01,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:01,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 14:34:01,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:34:01,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2021-08-27 14:34:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:01,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:34:01,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:34:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:34:01,617 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-08-27 14:34:01,617 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 363 states and 445 transitions. cyclomatic complexity: 98 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:34:01,801 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 363 states and 445 transitions. cyclomatic complexity: 98. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 379 states and 467 transitions. Complement of second has 20 states. [2021-08-27 14:34:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2021-08-27 14:34:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:34:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2021-08-27 14:34:01,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 56 transitions. Stem has 36 letters. Loop has 2 letters. [2021-08-27 14:34:01,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:34:01,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 56 transitions. Stem has 38 letters. Loop has 2 letters. [2021-08-27 14:34:01,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:34:01,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 56 transitions. Stem has 36 letters. Loop has 4 letters. [2021-08-27 14:34:01,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:34:01,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 467 transitions. [2021-08-27 14:34:01,810 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 74 [2021-08-27 14:34:01,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 318 states and 393 transitions. [2021-08-27 14:34:01,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2021-08-27 14:34:01,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2021-08-27 14:34:01,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 393 transitions. [2021-08-27 14:34:01,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:34:01,812 INFO L681 BuchiCegarLoop]: Abstraction has 318 states and 393 transitions. [2021-08-27 14:34:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 393 transitions. [2021-08-27 14:34:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 312. [2021-08-27 14:34:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 283 states have (on average 1.2120141342756183) internal successors, (343), 285 states have internal predecessors, (343), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2021-08-27 14:34:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 385 transitions. [2021-08-27 14:34:01,821 INFO L704 BuchiCegarLoop]: Abstraction has 312 states and 385 transitions. [2021-08-27 14:34:01,821 INFO L587 BuchiCegarLoop]: Abstraction has 312 states and 385 transitions. [2021-08-27 14:34:01,821 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 14:34:01,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 312 states and 385 transitions. [2021-08-27 14:34:01,823 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 74 [2021-08-27 14:34:01,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:34:01,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:34:01,823 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:34:01,823 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:34:01,824 INFO L791 eck$LassoCheckResult]: Stem: 9880#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9858#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; 9859#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 9861#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; 9862#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9863#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; 9864#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9865#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; 9907#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 9908#L40-3 assume !(main_~i~1 < main_~n~0); 9838#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 9894#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9982#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9979#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9980#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9983#L24 assume ~n < 2; 9981#L8 assume true; 9978#merge_sortEXIT >#86#return; 9842#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 9959#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9950#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 9951#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 9998#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10000#L24 assume ~n < 2; 9996#L8 assume true; 9997#merge_sortEXIT >#86#return; 9851#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 9850#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 9852#L24 assume ~n < 2; 9889#L8 assume true; 9871#merge_sortEXIT >#88#return; 9872#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 10123#L11-3 assume !!(merge_~k~0 < merge_~n); 9868#L12 assume !(merge_~j~0 == merge_~n); 9848#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); 9849#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; 10118#L14-2 merge_#t~ite14 := merge_#t~ite13; 10115#L13-2 merge_#t~ite15 := merge_#t~ite14; 10114#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 9892#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 9893#L11-3 assume !!(merge_~k~0 < merge_~n); 10125#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; 9899#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 9900#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10038#L11-3 assume !(merge_~k~0 < merge_~n); 10039#L11-4 merge_~i~0 := 0; 10082#L17-3 [2021-08-27 14:34:01,824 INFO L793 eck$LassoCheckResult]: Loop: 10082#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; 10083#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 10082#L17-3 [2021-08-27 14:34:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:01,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1884766896, now seen corresponding path program 2 times [2021-08-27 14:34:01,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:34:01,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234840633] [2021-08-27 14:34:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:01,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:34:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:01,839 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:34:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:01,868 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:34:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 5 times [2021-08-27 14:34:01,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:34:01,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713829406] [2021-08-27 14:34:01,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:01,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:34:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:01,873 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:34:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:01,876 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:34:01,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:01,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1215213458, now seen corresponding path program 2 times [2021-08-27 14:34:01,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:34:01,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720091162] [2021-08-27 14:34:01,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:01,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:34:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:01,912 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:34:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:01,930 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:34:05,658 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:34:05,658 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:34:05,658 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:34:05,658 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:34:05,658 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:34:05,658 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:05,658 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:34:05,658 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:34:05,658 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration16_Lasso [2021-08-27 14:34:05,658 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:34:05,658 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:34:05,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:05,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:05,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:05,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:05,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:05,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:05,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:05,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:05,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:05,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:05,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:06,739 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:34:06,739 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:34:06,739 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,740 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-08-27 14:34:06,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:06,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:06,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:06,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:06,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2021-08-27 14:34:06,763 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,764 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-08-27 14:34:06,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:06,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:06,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:06,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:06,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-08-27 14:34:06,788 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,789 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-08-27 14:34:06,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:06,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:06,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:06,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:06,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-08-27 14:34:06,812 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,813 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-08-27 14:34:06,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:06,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:06,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:06,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:06,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2021-08-27 14:34:06,836 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,836 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-08-27 14:34:06,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:06,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:06,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:06,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:06,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2021-08-27 14:34:06,859 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,860 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-08-27 14:34:06,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:06,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:06,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:06,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:06,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2021-08-27 14:34:06,886 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,887 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-08-27 14:34:06,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:06,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:06,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:06,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:06,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2021-08-27 14:34:06,910 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,911 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-08-27 14:34:06,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:06,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:06,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:06,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:06,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2021-08-27 14:34:06,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,935 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-08-27 14:34:06,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:06,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:06,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:06,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:06,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2021-08-27 14:34:06,959 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,960 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-08-27 14:34:06,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:06,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:06,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:06,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:06,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2021-08-27 14:34:06,987 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:06,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:06,988 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:06,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-08-27 14:34:06,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:06,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:06,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:06,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:06,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:06,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:34:06,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:34:07,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:07,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2021-08-27 14:34:07,016 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:07,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:07,016 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:07,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-08-27 14:34:07,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:07,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:07,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:07,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:07,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:07,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:34:07,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:34:07,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:07,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2021-08-27 14:34:07,042 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:07,043 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:07,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-08-27 14:34:07,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:07,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:07,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:07,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:07,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:07,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:34:07,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:34:07,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:07,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2021-08-27 14:34:07,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:07,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:07,070 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:07,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-08-27 14:34:07,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:07,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:07,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:07,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:07,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:07,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:34:07,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:34:07,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:07,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2021-08-27 14:34:07,103 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:07,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:07,103 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:07,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-08-27 14:34:07,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:07,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:07,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:07,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:07,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:07,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:34:07,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:34:07,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:07,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-08-27 14:34:07,133 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:07,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:07,134 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:07,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-08-27 14:34:07,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:07,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:07,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:07,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:07,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:07,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:34:07,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:34:07,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:07,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2021-08-27 14:34:07,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:07,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:07,161 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:07,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-08-27 14:34:07,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:07,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:07,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:34:07,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:07,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:07,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:07,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:34:07,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:34:07,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:34:07,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2021-08-27 14:34:07,185 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:07,185 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:07,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-08-27 14:34:07,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:34:07,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:34:07,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:34:07,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:34:07,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:34:07,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:34:07,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:34:07,222 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:34:07,273 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2021-08-27 14:34:07,273 INFO L444 ModelExtractionUtils]: 14 out of 64 variables were initially zero. Simplification set additionally 47 variables to zero. [2021-08-27 14:34:07,274 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:07,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:07,277 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:34:07,285 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:34:07,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-08-27 14:34:07,297 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 14:34:07,298 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:34:07,298 INFO L515 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 [] [2021-08-27 14:34:07,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2021-08-27 14:34:07,339 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2021-08-27 14:34:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:07,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 14:34:07,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:34:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:07,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:34:07,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:34:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:34:07,609 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 [2021-08-27 14:34:07,609 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 312 states and 385 transitions. cyclomatic complexity: 88 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:34:07,646 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 312 states and 385 transitions. cyclomatic complexity: 88. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 326 states and 407 transitions. Complement of second has 9 states. [2021-08-27 14:34:07,646 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 [2021-08-27 14:34:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 14:34:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2021-08-27 14:34:07,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 46 letters. Loop has 2 letters. [2021-08-27 14:34:07,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:34:07,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 48 letters. Loop has 2 letters. [2021-08-27 14:34:07,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:34:07,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 46 letters. Loop has 4 letters. [2021-08-27 14:34:07,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:34:07,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 407 transitions. [2021-08-27 14:34:07,649 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2021-08-27 14:34:07,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 314 states and 389 transitions. [2021-08-27 14:34:07,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2021-08-27 14:34:07,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2021-08-27 14:34:07,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 389 transitions. [2021-08-27 14:34:07,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:34:07,652 INFO L681 BuchiCegarLoop]: Abstraction has 314 states and 389 transitions. [2021-08-27 14:34:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 389 transitions. [2021-08-27 14:34:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2021-08-27 14:34:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 285 states have (on average 1.2175438596491228) internal successors, (347), 287 states have internal predecessors, (347), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2021-08-27 14:34:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 389 transitions. [2021-08-27 14:34:07,656 INFO L704 BuchiCegarLoop]: Abstraction has 314 states and 389 transitions. [2021-08-27 14:34:07,656 INFO L587 BuchiCegarLoop]: Abstraction has 314 states and 389 transitions. [2021-08-27 14:34:07,656 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 14:34:07,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 389 transitions. [2021-08-27 14:34:07,657 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2021-08-27 14:34:07,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:34:07,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:34:07,661 INFO L842 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] [2021-08-27 14:34:07,661 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:34:07,661 INFO L791 eck$LassoCheckResult]: Stem: 10744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10723#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; 10724#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 10727#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; 10728#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10771#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; 10772#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10729#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; 10730#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 10731#L40-3 assume !(main_~i~1 < main_~n~0); 10761#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 10762#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10836#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 10824#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 10828#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10830#L24 assume ~n < 2; 10829#L8 assume true; 10823#merge_sortEXIT >#86#return; 10708#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 10818#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10781#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 10782#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 10874#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10876#L24 assume ~n < 2; 10872#L8 assume true; 10873#merge_sortEXIT >#86#return; 10714#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 10713#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 10715#L24 assume ~n < 2; 10756#L8 assume true; 10737#merge_sortEXIT >#88#return; 10738#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 10745#L11-3 assume !!(merge_~k~0 < merge_~n); 10746#L12 assume !(merge_~j~0 == merge_~n); 11002#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); 11000#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; 10998#L14-2 merge_#t~ite14 := merge_#t~ite13; 10999#L13-2 merge_#t~ite15 := merge_#t~ite14; 11008#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 11006#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11004#L11-3 assume !!(merge_~k~0 < merge_~n); 11005#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; 10766#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 10938#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10939#L11-3 assume !(merge_~k~0 < merge_~n); 10780#L11-4 merge_~i~0 := 0; 10752#L17-3 assume !(merge_~i~0 < merge_~n); 10753#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 10863#L8 assume true; 10817#merge_sortEXIT >#88#return; 10816#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 10815#L11-3 assume !!(merge_~k~0 < merge_~n); 10814#L12 assume !(merge_~j~0 == merge_~n); 10813#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); 10810#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; 10807#L14-2 merge_#t~ite14 := merge_#t~ite13; 10805#L13-2 merge_#t~ite15 := merge_#t~ite14; 10803#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 10801#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10799#L11-3 assume !!(merge_~k~0 < merge_~n); 10798#L12 [2021-08-27 14:34:07,662 INFO L793 eck$LassoCheckResult]: Loop: 10798#L12 assume !(merge_~j~0 == merge_~n); 10812#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); 10808#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; 10809#L14-2 merge_#t~ite14 := merge_#t~ite13; 10868#L13-2 merge_#t~ite15 := merge_#t~ite14; 10791#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 10792#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 10797#L11-3 assume !!(merge_~k~0 < merge_~n); 10798#L12 [2021-08-27 14:34:07,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:07,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1719261906, now seen corresponding path program 1 times [2021-08-27 14:34:07,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:34:07,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589763818] [2021-08-27 14:34:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:07,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:34:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:07,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 14:34:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 14:34:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:07,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 14:34:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:07,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-27 14:34:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-27 14:34:07,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:34:07,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589763818] [2021-08-27 14:34:07,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589763818] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:34:07,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752945357] [2021-08-27 14:34:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:07,730 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:34:07,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:07,733 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:34:07,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2021-08-27 14:34:07,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2021-08-27 14:34:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:08,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 14:34:08,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:34:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-27 14:34:08,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752945357] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:34:08,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:34:08,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14] total 18 [2021-08-27 14:34:08,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466710555] [2021-08-27 14:34:08,312 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:34:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2021-08-27 14:34:08,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:34:08,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219072039] [2021-08-27 14:34:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:08,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:34:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:08,316 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:34:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:08,318 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:34:08,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:34:08,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 14:34:08,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-08-27 14:34:08,480 INFO L87 Difference]: Start difference. First operand 314 states and 389 transitions. cyclomatic complexity: 90 Second operand has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 14:34:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:34:09,011 INFO L93 Difference]: Finished difference Result 426 states and 527 transitions. [2021-08-27 14:34:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 14:34:09,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 426 states and 527 transitions. [2021-08-27 14:34:09,019 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 124 [2021-08-27 14:34:09,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 426 states to 426 states and 527 transitions. [2021-08-27 14:34:09,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2021-08-27 14:34:09,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2021-08-27 14:34:09,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 426 states and 527 transitions. [2021-08-27 14:34:09,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:34:09,021 INFO L681 BuchiCegarLoop]: Abstraction has 426 states and 527 transitions. [2021-08-27 14:34:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states and 527 transitions. [2021-08-27 14:34:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 316. [2021-08-27 14:34:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 287 states have (on average 1.2055749128919862) internal successors, (346), 289 states have internal predecessors, (346), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2021-08-27 14:34:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 388 transitions. [2021-08-27 14:34:09,026 INFO L704 BuchiCegarLoop]: Abstraction has 316 states and 388 transitions. [2021-08-27 14:34:09,026 INFO L587 BuchiCegarLoop]: Abstraction has 316 states and 388 transitions. [2021-08-27 14:34:09,026 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-08-27 14:34:09,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 388 transitions. [2021-08-27 14:34:09,027 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2021-08-27 14:34:09,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:34:09,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:34:09,028 INFO L842 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] [2021-08-27 14:34:09,028 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:34:09,028 INFO L791 eck$LassoCheckResult]: Stem: 11754#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11735#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; 11736#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 11738#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; 11739#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11783#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; 11784#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11740#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; 11741#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 11742#L40-3 assume !(main_~i~1 < main_~n~0); 11715#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 11777#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11843#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11724#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11723#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11725#L24 assume ~n < 2; 11844#L8 assume true; 11838#merge_sortEXIT >#86#return; 11719#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 11804#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11798#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 11799#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 11842#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11850#L24 assume ~n < 2; 11840#L8 assume true; 11841#merge_sortEXIT >#86#return; 11750#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 11763#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 11769#L24 assume ~n < 2; 11770#L8 assume true; 11749#merge_sortEXIT >#88#return; 11751#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 11998#L11-3 assume !!(merge_~k~0 < merge_~n); 11997#L12 assume !(merge_~j~0 == merge_~n); 11996#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); 11994#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; 11995#L14-2 merge_#t~ite14 := merge_#t~ite13; 11990#L13-2 merge_#t~ite15 := merge_#t~ite14; 11991#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 11774#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11757#L11-3 assume !!(merge_~k~0 < merge_~n); 11758#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; 11999#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 12008#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 12007#L11-3 assume !(merge_~k~0 < merge_~n); 11855#L11-4 merge_~i~0 := 0; 11764#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; 11761#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 11762#L17-3 assume !(merge_~i~0 < merge_~n); 11721#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 11722#L8 assume true; 11737#merge_sortEXIT >#88#return; 11747#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 11748#L11-3 assume !!(merge_~k~0 < merge_~n); 12017#L12 assume !(merge_~j~0 == merge_~n); 12016#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); 12014#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; 12015#L14-2 merge_#t~ite14 := merge_#t~ite13; 12025#L13-2 merge_#t~ite15 := merge_#t~ite14; 12010#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 12009#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11755#L11-3 assume !!(merge_~k~0 < merge_~n); 11756#L12 [2021-08-27 14:34:09,028 INFO L793 eck$LassoCheckResult]: Loop: 11756#L12 assume !(merge_~j~0 == merge_~n); 11731#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); 11732#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; 11714#L14-2 merge_#t~ite14 := merge_#t~ite13; 11716#L13-2 merge_#t~ite15 := merge_#t~ite14; 11778#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 11772#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 11773#L11-3 assume !!(merge_~k~0 < merge_~n); 11756#L12 [2021-08-27 14:34:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2004988308, now seen corresponding path program 1 times [2021-08-27 14:34:09,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:34:09,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547052663] [2021-08-27 14:34:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:09,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:34:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:09,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 14:34:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:09,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 14:34:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:09,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 14:34:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:09,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-27 14:34:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-27 14:34:09,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:34:09,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547052663] [2021-08-27 14:34:09,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547052663] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:34:09,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282143267] [2021-08-27 14:34:09,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:09,103 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:34:09,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:34:09,104 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:34:09,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2021-08-27 14:34:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:34:09,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 14:34:09,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:34:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-27 14:34:09,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282143267] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:34:09,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:34:09,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2021-08-27 14:34:09,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754420093] [2021-08-27 14:34:09,751 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:34:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:09,751 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2021-08-27 14:34:09,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:34:09,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462170825] [2021-08-27 14:34:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:09,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:34:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:09,757 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:34:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:09,760 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:34:09,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:34:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 14:34:09,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-08-27 14:34:09,913 INFO L87 Difference]: Start difference. First operand 316 states and 388 transitions. cyclomatic complexity: 87 Second operand has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 17 states have internal predecessors, (70), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 14:34:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:34:10,910 INFO L93 Difference]: Finished difference Result 631 states and 795 transitions. [2021-08-27 14:34:10,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-27 14:34:10,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 631 states and 795 transitions. [2021-08-27 14:34:10,913 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 208 [2021-08-27 14:34:10,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 631 states to 631 states and 795 transitions. [2021-08-27 14:34:10,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2021-08-27 14:34:10,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 420 [2021-08-27 14:34:10,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 631 states and 795 transitions. [2021-08-27 14:34:10,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:34:10,916 INFO L681 BuchiCegarLoop]: Abstraction has 631 states and 795 transitions. [2021-08-27 14:34:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states and 795 transitions. [2021-08-27 14:34:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 326. [2021-08-27 14:34:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 297 states have (on average 1.1986531986531987) internal successors, (356), 299 states have internal predecessors, (356), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2021-08-27 14:34:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 398 transitions. [2021-08-27 14:34:10,921 INFO L704 BuchiCegarLoop]: Abstraction has 326 states and 398 transitions. [2021-08-27 14:34:10,921 INFO L587 BuchiCegarLoop]: Abstraction has 326 states and 398 transitions. [2021-08-27 14:34:10,922 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-08-27 14:34:10,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 398 transitions. [2021-08-27 14:34:10,923 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2021-08-27 14:34:10,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:34:10,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:34:10,923 INFO L842 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] [2021-08-27 14:34:10,923 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:34:10,924 INFO L791 eck$LassoCheckResult]: Stem: 13017#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12995#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; 12996#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;havoc main_#t~malloc19.base, main_#t~malloc19.offset;main_~i~1 := 0; 12999#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; 13000#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13040#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; 13041#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13001#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; 13002#L40-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 13003#L40-3 assume !(main_~i~1 < main_~n~0); 12974#L40-4 call merge_sort(main_~a~0.base, main_~a~0.offset, main_~n~0);< 13033#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13100#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 13012#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 13013#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13110#L24 assume ~n < 2; 13109#L8 assume true; 13108#merge_sortEXIT >#86#return; 12978#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 13069#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13055#L24 assume !(~n < 2);~m~0 := (if ~n < 0 && 0 != ~n % 2 then 1 + ~n / 2 else ~n / 2); 13056#L27 call merge_sort(~a.base, ~a.offset, ~m~0);< 13099#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 13107#L24 assume ~n < 2; 13097#L8 assume true; 13098#merge_sortEXIT >#86#return; 12984#L27-1 call merge_sort(~a.base, ~a.offset + 4 * ~m~0, ~n - ~m~0);< 12983#merge_sortENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n; 12985#L24 assume ~n < 2; 13027#L8 assume true; 13180#merge_sortEXIT >#88#return; 13181#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 13177#L11-3 assume !!(merge_~k~0 < merge_~n); 13178#L12 assume !(merge_~j~0 == merge_~n); 13173#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); 13174#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; 13197#L14-2 merge_#t~ite14 := merge_#t~ite13; 13196#L13-2 merge_#t~ite15 := merge_#t~ite14; 13195#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 13194#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13193#L11-3 assume !!(merge_~k~0 < merge_~n); 13190#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; 13191#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 13223#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13222#L11-3 assume !(merge_~k~0 < merge_~n); 13129#L11-4 merge_~i~0 := 0; 13059#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; 13060#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 13025#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; 13026#L17-2 merge_#t~post16 := merge_~i~0;merge_~i~0 := 1 + merge_#t~post16;havoc merge_#t~post16; 13044#L17-3 assume !(merge_~i~0 < merge_~n); 13045#L17-4 call ULTIMATE.dealloc(merge_~x~0.base, merge_~x~0.offset); 12997#L8 assume true; 12998#merge_sortEXIT >#88#return; 13008#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;havoc merge_#t~malloc1.base, merge_#t~malloc1.offset;merge_~i~0 := 0;merge_~j~0 := merge_~m;merge_~k~0 := 0; 13009#L11-3 assume !!(merge_~k~0 < merge_~n); 13289#L12 assume !(merge_~j~0 == merge_~n); 13288#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); 13286#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; 13284#L14-2 merge_#t~ite14 := merge_#t~ite13; 13285#L13-2 merge_#t~ite15 := merge_#t~ite14; 13280#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 13281#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13018#L11-3 assume !!(merge_~k~0 < merge_~n); 13019#L12 [2021-08-27 14:34:10,924 INFO L793 eck$LassoCheckResult]: Loop: 13019#L12 assume !(merge_~j~0 == merge_~n); 12991#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); 12992#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; 12973#L14-2 merge_#t~ite14 := merge_#t~ite13; 12975#L13-2 merge_#t~ite15 := merge_#t~ite14; 13034#L12-2 call write~int(merge_#t~ite15, merge_~x~0.base, merge_~x~0.offset + 4 * merge_~k~0, 4);havoc merge_#t~ite15;havoc merge_#t~post3;havoc merge_#t~mem4;havoc merge_#t~ite14;havoc merge_#t~post5;havoc merge_#t~mem6;havoc merge_#t~mem7;havoc merge_#t~mem8;havoc merge_#t~ite13;havoc merge_#t~post9;havoc merge_#t~mem10;havoc merge_#t~post11;havoc merge_#t~mem12; 13028#L11-2 merge_#t~post2 := merge_~k~0;merge_~k~0 := 1 + merge_#t~post2;havoc merge_#t~post2; 13029#L11-3 assume !!(merge_~k~0 < merge_~n); 13019#L12 [2021-08-27 14:34:10,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1710153686, now seen corresponding path program 2 times [2021-08-27 14:34:10,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:34:10,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199622259] [2021-08-27 14:34:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:10,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:34:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:10,942 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:34:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:10,969 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:34:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2021-08-27 14:34:10,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:34:10,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796558654] [2021-08-27 14:34:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:10,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:34:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:10,974 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:34:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:10,976 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:34:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:34:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1618831734, now seen corresponding path program 3 times [2021-08-27 14:34:10,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:34:10,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231964164] [2021-08-27 14:34:10,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:34:10,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:34:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:11,001 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:34:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:34:11,029 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:34:24,462 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:34:24,462 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:34:24,462 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:34:24,462 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:34:24,462 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:34:24,462 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:34:24,462 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:34:24,462 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:34:24,462 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration19_Lasso [2021-08-27 14:34:24,462 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:34:24,463 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:34:24,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:24,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:34:25,088 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:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) 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:63) [2021-08-27 14:34:25,091 INFO L168 Benchmark]: Toolchain (without parser) took 46531.77 ms. Allocated memory was 58.7 MB in the beginning and 390.1 MB in the end (delta: 331.4 MB). Free memory was 37.6 MB in the beginning and 156.2 MB in the end (delta: -118.6 MB). Peak memory consumption was 314.4 MB. Max. memory is 16.1 GB. [2021-08-27 14:34:25,092 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 58.7 MB. Free memory was 40.9 MB in the beginning and 40.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:34:25,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.32 ms. Allocated memory is still 58.7 MB. Free memory was 37.4 MB in the beginning and 43.3 MB in the end (delta: -5.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:34:25,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.79 ms. Allocated memory is still 58.7 MB. Free memory was 43.1 MB in the beginning and 41.6 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:34:25,092 INFO L168 Benchmark]: Boogie Preprocessor took 34.28 ms. Allocated memory is still 58.7 MB. Free memory was 41.6 MB in the beginning and 40.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:34:25,092 INFO L168 Benchmark]: RCFGBuilder took 388.53 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 40.2 MB in the beginning and 50.1 MB in the end (delta: -10.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2021-08-27 14:34:25,093 INFO L168 Benchmark]: BuchiAutomizer took 45860.63 ms. Allocated memory was 71.3 MB in the beginning and 390.1 MB in the end (delta: 318.8 MB). Free memory was 49.8 MB in the beginning and 156.2 MB in the end (delta: -106.4 MB). Peak memory consumption was 314.0 MB. Max. memory is 16.1 GB. [2021-08-27 14:34:25,094 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.10 ms. Allocated memory is still 58.7 MB. Free memory was 40.9 MB in the beginning and 40.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 197.32 ms. Allocated memory is still 58.7 MB. Free memory was 37.4 MB in the beginning and 43.3 MB in the end (delta: -5.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.79 ms. Allocated memory is still 58.7 MB. Free memory was 43.1 MB in the beginning and 41.6 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.28 ms. Allocated memory is still 58.7 MB. Free memory was 41.6 MB in the beginning and 40.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 388.53 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 40.2 MB in the beginning and 50.1 MB in the end (delta: -10.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 45860.63 ms. Allocated memory was 71.3 MB in the beginning and 390.1 MB in the end (delta: 318.8 MB). Free memory was 49.8 MB in the beginning and 156.2 MB in the end (delta: -106.4 MB). Peak memory consumption was 314.0 MB. Max. memory is 16.1 GB. * 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. [2021-08-27 14:34:25,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2021-08-27 14:34:25,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2021-08-27 14:34:25,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2021-08-27 14:34:25,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2021-08-27 14:34:25,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2021-08-27 14:34:26,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2021-08-27 14:34:26,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2021-08-27 14:34:26,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-08-27 14:34:26,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-08-27 14:34:26,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...