./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 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(F end) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', 'e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 23:55:34,966 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 23:55:35,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf
[2024-11-07 23:55:35,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 23:55:35,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 23:55:35,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 23:55:35,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 23:55:35,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 23:55:35,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 23:55:35,096 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 23:55:35,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 23:55:35,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 23:55:35,097 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 23:55:35,097 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-07 23:55:35,098 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2024-11-07 23:55:35,098 INFO L153 SettingsManager]: * Use old map elimination=false
[2024-11-07 23:55:35,098 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false
[2024-11-07 23:55:35,099 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true
[2024-11-07 23:55:35,099 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-07 23:55:35,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 23:55:35,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2024-11-07 23:55:35,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 23:55:35,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 23:55:35,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2024-11-07 23:55:35,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-07 23:55:35,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2024-11-07 23:55:35,100 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 23:55:35,100 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 23:55:35,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 23:55:35,100 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false
[2024-11-07 23:55:35,100 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 23:55:35,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 23:55:35,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 23:55:35,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 23:55:35,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 23:55:35,101 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-07 23:55:35,102 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4
[2024-11-07 23:55:35,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 23:55:35,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 23:55:35,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 23:55:35,410 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 23:55:35,410 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 23:55:35,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i
[2024-11-07 23:55:36,654 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 23:55:36,866 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 23:55:36,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i
[2024-11-07 23:55:36,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/090afd983/268ac919e6fb4afea9f03f7509af9f7f/FLAGe4f408588
[2024-11-07 23:55:36,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/090afd983/268ac919e6fb4afea9f03f7509af9f7f
[2024-11-07 23:55:36,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 23:55:36,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 23:55:36,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 23:55:36,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 23:55:36,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 23:55:36,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:55:36" (1/1) ...
[2024-11-07 23:55:36,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcc960e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:36, skipping insertion in model container
[2024-11-07 23:55:36,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:55:36" (1/1) ...
[2024-11-07 23:55:36,916 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 23:55:37,027 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 23:55:37,036 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 23:55:37,051 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 23:55:37,065 INFO L204 MainTranslator]: Completed translation
[2024-11-07 23:55:37,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37 WrapperNode
[2024-11-07 23:55:37,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 23:55:37,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 23:55:37,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 23:55:37,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 23:55:37,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,106 INFO L138 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103
[2024-11-07 23:55:37,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 23:55:37,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 23:55:37,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 23:55:37,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 23:55:37,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,138 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2].
[2024-11-07 23:55:37,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 23:55:37,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 23:55:37,167 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 23:55:37,167 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 23:55:37,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (1/1) ...
[2024-11-07 23:55:37,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:37,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:37,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:37,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-07 23:55:37,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-07 23:55:37,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-07 23:55:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort
[2024-11-07 23:55:37,233 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort
[2024-11-07 23:55:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-07 23:55:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 23:55:37,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 23:55:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-07 23:55:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-07 23:55:37,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 23:55:37,322 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 23:55:37,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 23:55:37,526 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live.
[2024-11-07 23:55:37,527 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 23:55:37,538 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 23:55:37,539 INFO L316 CfgBuilder]: Removed 3 assume(true) statements.
[2024-11-07 23:55:37,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:55:37 BoogieIcfgContainer
[2024-11-07 23:55:37,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 23:55:37,540 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-07 23:55:37,540 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2024-11-07 23:55:37,544 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2024-11-07 23:55:37,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:55:37,545 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 11:55:36" (1/3) ...
[2024-11-07 23:55:37,546 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23020f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:55:37, skipping insertion in model container
[2024-11-07 23:55:37,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:55:37,546 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:55:37" (2/3) ...
[2024-11-07 23:55:37,547 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23020f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:55:37, skipping insertion in model container
[2024-11-07 23:55:37,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:55:37,547 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:55:37" (3/3) ...
[2024-11-07 23:55:37,548 INFO L332 chiAutomizerObserver]: Analyzing ICFG mergeSort.i
[2024-11-07 23:55:37,600 INFO L300 stractBuchiCegarLoop]: Interprodecural is true
[2024-11-07 23:55:37,600 INFO L301 stractBuchiCegarLoop]: Hoare is None
[2024-11-07 23:55:37,600 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-07 23:55:37,601 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-07 23:55:37,601 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-07 23:55:37,601 INFO L305 stractBuchiCegarLoop]: Difference is false
[2024-11-07 23:55:37,602 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-07 23:55:37,602 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-07 23:55:37,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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)
[2024-11-07 23:55:37,624 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16
[2024-11-07 23:55:37,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:37,626 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:37,629 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-07 23:55:37,629 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:55:37,630 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-07 23:55:37,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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)
[2024-11-07 23:55:37,632 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16
[2024-11-07 23:55:37,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:37,632 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:37,632 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-07 23:55:37,632 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:55:37,640 INFO L745 eck$LassoCheckResult]: Stem: 29#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16#L35true assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 10#L40-3true
[2024-11-07 23:55:37,640 INFO L747 eck$LassoCheckResult]: Loop: 10#L40-3true assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 11#L40-2true main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 10#L40-3true
[2024-11-07 23:55:37,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash 89440, now seen corresponding path program 1 times
[2024-11-07 23:55:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044309872]
[2024-11-07 23:55:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:37,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:37,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:37,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:37,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times
[2024-11-07 23:55:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:37,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774899280]
[2024-11-07 23:55:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:37,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:37,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:37,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:37,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:37,805 INFO L85 PathProgramCache]: Analyzing trace with hash 85954242, now seen corresponding path program 1 times
[2024-11-07 23:55:37,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:37,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822900210]
[2024-11-07 23:55:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:37,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:37,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:38,089 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:55:38,090 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:55:38,090 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:55:38,090 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:55:38,090 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:55:38,090 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,090 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:55:38,090 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:55:38,091 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso
[2024-11-07 23:55:38,091 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:55:38,092 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:55:38,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:38,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:38,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:38,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:38,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:38,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:38,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:38,450 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:55:38,453 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:55:38,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,459 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
[2024-11-07 23:55:38,474 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:38,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:38,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:38,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:38,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:38,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:38,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:38,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:38,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0
[2024-11-07 23:55:38,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,503 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
[2024-11-07 23:55:38,513 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:38,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:38,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:38,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:38,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:38,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:38,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:38,516 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:38,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0
[2024-11-07 23:55:38,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,530 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
[2024-11-07 23:55:38,542 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:38,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:38,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:38,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:38,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:38,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:38,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:38,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:38,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0
[2024-11-07 23:55:38,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,561 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
[2024-11-07 23:55:38,571 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:38,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:38,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:38,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:38,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:38,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:38,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:38,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:38,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2024-11-07 23:55:38,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,587 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,589 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
[2024-11-07 23:55:38,598 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:38,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:38,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:38,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:38,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:38,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:38,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:38,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:38,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0
[2024-11-07 23:55:38,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,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
[2024-11-07 23:55:38,624 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:38,624 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts
[2024-11-07 23:55:38,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:38,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:38,629 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications.
[2024-11-07 23:55:38,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:38,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:38,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2024-11-07 23:55:38,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,653 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,656 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
[2024-11-07 23:55:38,668 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:38,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:38,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:38,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:38,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:38,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:38,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:38,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:38,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0
[2024-11-07 23:55:38,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,691 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
[2024-11-07 23:55:38,704 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:38,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:38,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:38,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:38,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:38,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:38,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:38,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0
[2024-11-07 23:55:38,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,728 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,730 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
[2024-11-07 23:55:38,742 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:38,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:38,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:38,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:38,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:38,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:38,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:38,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0
[2024-11-07 23:55:38,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,784 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,786 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
[2024-11-07 23:55:38,799 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:38,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:38,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:38,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:38,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:38,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:38,816 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:55:38,846 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver.
[2024-11-07 23:55:38,848 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero.
[2024-11-07 23:55:38,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:38,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:38,853 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:38,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process
[2024-11-07 23:55:38,855 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:55:38,870 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-07 23:55:38,870 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:55:38,871 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~i~1#1
Supporting invariants []
[2024-11-07 23:55:38,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2024-11-07 23:55:38,890 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed
[2024-11-07 23:55:38,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:38,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:38,929 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:38,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:38,949 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:38,997 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-07 23:55:38,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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)
[2024-11-07 23:55:39,054 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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 62 states and 85 transitions. Complement of second has 7 states.
[2024-11-07 23:55:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-07 23:55:39,058 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)
[2024-11-07 23:55:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions.
[2024-11-07 23:55:39,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 2 letters.
[2024-11-07 23:55:39,069 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:39,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 5 letters. Loop has 2 letters.
[2024-11-07 23:55:39,069 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:39,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 4 letters.
[2024-11-07 23:55:39,069 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:39,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 85 transitions.
[2024-11-07 23:55:39,074 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-07 23:55:39,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 28 states and 39 transitions.
[2024-11-07 23:55:39,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25
[2024-11-07 23:55:39,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26
[2024-11-07 23:55:39,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions.
[2024-11-07 23:55:39,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-07 23:55:39,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions.
[2024-11-07 23:55:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions.
[2024-11-07 23:55:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2024-11-07 23:55:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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)
[2024-11-07 23:55:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions.
[2024-11-07 23:55:39,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions.
[2024-11-07 23:55:39,112 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 39 transitions.
[2024-11-07 23:55:39,112 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-07 23:55:39,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions.
[2024-11-07 23:55:39,114 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-07 23:55:39,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:39,115 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:39,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:39,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-07 23:55:39,116 INFO L745 eck$LassoCheckResult]: Stem: 164#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 148#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 150#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 151#L40-4 havoc main_~i~1#1; 137#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 138#$Ultimate##0
[2024-11-07 23:55:39,117 INFO L747 eck$LassoCheckResult]: Loop: 138#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 159#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 140#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 138#$Ultimate##0
[2024-11-07 23:55:39,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1630387501, now seen corresponding path program 1 times
[2024-11-07 23:55:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:39,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723752130]
[2024-11-07 23:55:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:39,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:55:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723752130]
[2024-11-07 23:55:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723752130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:55:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:55:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 23:55:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570981146]
[2024-11-07 23:55:39,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:55:39,225 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:55:39,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:39,226 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 1 times
[2024-11-07 23:55:39,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:39,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278830584]
[2024-11-07 23:55:39,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:39,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:39,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:39,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:55:39,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 23:55:39,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 23:55:39,472 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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)
[2024-11-07 23:55:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:55:39,485 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions.
[2024-11-07 23:55:39,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions.
[2024-11-07 23:55:39,487 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-07 23:55:39,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions.
[2024-11-07 23:55:39,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26
[2024-11-07 23:55:39,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26
[2024-11-07 23:55:39,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions.
[2024-11-07 23:55:39,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-07 23:55:39,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions.
[2024-11-07 23:55:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions.
[2024-11-07 23:55:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28.
[2024-11-07 23:55:39,490 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)
[2024-11-07 23:55:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions.
[2024-11-07 23:55:39,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions.
[2024-11-07 23:55:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 23:55:39,491 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions.
[2024-11-07 23:55:39,492 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-07 23:55:39,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions.
[2024-11-07 23:55:39,493 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-07 23:55:39,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:39,493 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:39,493 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:39,493 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-07 23:55:39,494 INFO L745 eck$LassoCheckResult]: Stem: 227#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 211#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 213#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 214#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 215#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 216#L40-4 havoc main_~i~1#1; 200#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 201#$Ultimate##0
[2024-11-07 23:55:39,494 INFO L747 eck$LassoCheckResult]: Loop: 201#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 222#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 204#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 201#$Ultimate##0
[2024-11-07 23:55:39,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash 862387761, now seen corresponding path program 1 times
[2024-11-07 23:55:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510332556]
[2024-11-07 23:55:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:39,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:39,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:39,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 2 times
[2024-11-07 23:55:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388729915]
[2024-11-07 23:55:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:39,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:39,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:39,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:39,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1100576510, now seen corresponding path program 1 times
[2024-11-07 23:55:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786415809]
[2024-11-07 23:55:39,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:39,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0
[2024-11-07 23:55:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:55:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786415809]
[2024-11-07 23:55:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786415809] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:55:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221710572]
[2024-11-07 23:55:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:39,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:55:39,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:39,736 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:55:39,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-11-07 23:55:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:39,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:39,800 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:39,833 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:55:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:39,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221710572] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:55:39,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:55:39,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8
[2024-11-07 23:55:39,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474704267]
[2024-11-07 23:55:39,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:55:40,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:55:40,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 23:55:40,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-11-07 23:55:40,094 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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)
[2024-11-07 23:55:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:55:40,154 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions.
[2024-11-07 23:55:40,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions.
[2024-11-07 23:55:40,158 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-07 23:55:40,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 31 states and 39 transitions.
[2024-11-07 23:55:40,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26
[2024-11-07 23:55:40,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26
[2024-11-07 23:55:40,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions.
[2024-11-07 23:55:40,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-07 23:55:40,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions.
[2024-11-07 23:55:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions.
[2024-11-07 23:55:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30.
[2024-11-07 23:55:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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)
[2024-11-07 23:55:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions.
[2024-11-07 23:55:40,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions.
[2024-11-07 23:55:40,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 23:55:40,168 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions.
[2024-11-07 23:55:40,168 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-07 23:55:40,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions.
[2024-11-07 23:55:40,169 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-07 23:55:40,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:40,169 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:40,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:40,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-07 23:55:40,170 INFO L745 eck$LassoCheckResult]: Stem: 368#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 351#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 353#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 354#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 355#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 356#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 369#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 367#L40-4 havoc main_~i~1#1; 340#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 341#$Ultimate##0
[2024-11-07 23:55:40,170 INFO L747 eck$LassoCheckResult]: Loop: 341#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 362#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 344#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 341#$Ultimate##0
[2024-11-07 23:55:40,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash -172336625, now seen corresponding path program 2 times
[2024-11-07 23:55:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:40,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062217631]
[2024-11-07 23:55:40,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:40,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:40,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:40,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:40,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 3 times
[2024-11-07 23:55:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:40,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142708425]
[2024-11-07 23:55:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:40,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:40,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:40,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1594476444, now seen corresponding path program 2 times
[2024-11-07 23:55:40,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:40,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629948549]
[2024-11-07 23:55:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:40,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:40,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:40,895 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:55:40,895 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:55:40,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:55:40,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:55:40,895 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:55:40,895 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:40,895 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:55:40,895 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:55:40,895 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso
[2024-11-07 23:55:40,895 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:55:40,896 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:55:40,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:40,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:41,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:41,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:41,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:41,557 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:55:41,557 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:55:41,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,562 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
[2024-11-07 23:55:41,575 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0
[2024-11-07 23:55:41,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,589 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,591 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
[2024-11-07 23:55:41,600 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0
[2024-11-07 23:55:41,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,622 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,624 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
[2024-11-07 23:55:41,635 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0
[2024-11-07 23:55:41,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,654 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,657 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
[2024-11-07 23:55:41,669 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0
[2024-11-07 23:55:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,691 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,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
[2024-11-07 23:55:41,702 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0
[2024-11-07 23:55:41,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,716 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,718 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
[2024-11-07 23:55:41,727 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0
[2024-11-07 23:55:41,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,742 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,743 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
[2024-11-07 23:55:41,753 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0
[2024-11-07 23:55:41,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,767 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,773 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
[2024-11-07 23:55:41,783 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0
[2024-11-07 23:55:41,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,799 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,800 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
[2024-11-07 23:55:41,810 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:41,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,824 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,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
[2024-11-07 23:55:41,835 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0
[2024-11-07 23:55:41,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,849 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,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
[2024-11-07 23:55:41,862 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0
[2024-11-07 23:55:41,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,875 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,877 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
[2024-11-07 23:55:41,886 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:41,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,905 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,907 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
[2024-11-07 23:55:41,917 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:41,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,931 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,933 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
[2024-11-07 23:55:41,942 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0
[2024-11-07 23:55:41,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,957 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,959 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
[2024-11-07 23:55:41,969 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:41,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:41,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0
[2024-11-07 23:55:41,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:41,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:41,987 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:41,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process
[2024-11-07 23:55:41,988 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
[2024-11-07 23:55:41,998 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:41,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:41,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:41,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:41,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:41,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:41,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0
[2024-11-07 23:55:42,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,012 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,014 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
[2024-11-07 23:55:42,023 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0
[2024-11-07 23:55:42,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,038 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,039 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
[2024-11-07 23:55:42,049 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0
[2024-11-07 23:55:42,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,063 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,064 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
[2024-11-07 23:55:42,074 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0
[2024-11-07 23:55:42,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,093 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,096 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
[2024-11-07 23:55:42,108 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:42,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,130 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,133 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
[2024-11-07 23:55:42,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,145 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:42,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,165 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,167 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
[2024-11-07 23:55:42,179 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0
[2024-11-07 23:55:42,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,198 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,200 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
[2024-11-07 23:55:42,212 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:42,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,233 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,236 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
[2024-11-07 23:55:42,247 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0
[2024-11-07 23:55:42,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,262 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,264 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
[2024-11-07 23:55:42,273 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0
[2024-11-07 23:55:42,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,295 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,297 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
[2024-11-07 23:55:42,310 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:42,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,331 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,333 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
[2024-11-07 23:55:42,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,344 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:42,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,358 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,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
[2024-11-07 23:55:42,369 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0
[2024-11-07 23:55:42,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,383 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,384 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
[2024-11-07 23:55:42,393 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0
[2024-11-07 23:55:42,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,407 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,408 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
[2024-11-07 23:55:42,418 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0
[2024-11-07 23:55:42,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,437 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,439 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
[2024-11-07 23:55:42,452 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0
[2024-11-07 23:55:42,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,473 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,476 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
[2024-11-07 23:55:42,488 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0
[2024-11-07 23:55:42,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,505 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,506 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
[2024-11-07 23:55:42,516 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0
[2024-11-07 23:55:42,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,532 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,534 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
[2024-11-07 23:55:42,544 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0
[2024-11-07 23:55:42,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,563 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,567 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
[2024-11-07 23:55:42,579 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0
[2024-11-07 23:55:42,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,600 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,601 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
[2024-11-07 23:55:42,611 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0
[2024-11-07 23:55:42,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,625 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,626 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
[2024-11-07 23:55:42,636 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0
[2024-11-07 23:55:42,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,650 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,652 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
[2024-11-07 23:55:42,662 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0
[2024-11-07 23:55:42,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,678 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,679 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
[2024-11-07 23:55:42,689 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0
[2024-11-07 23:55:42,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,704 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,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
[2024-11-07 23:55:42,719 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:42,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:42,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:42,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0
[2024-11-07 23:55:42,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,741 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,744 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
[2024-11-07 23:55:42,756 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:42,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:42,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0
[2024-11-07 23:55:42,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,781 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,783 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
[2024-11-07 23:55:42,796 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,796 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts
[2024-11-07 23:55:42,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,798 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications.
[2024-11-07 23:55:42,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:42,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:42,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,820 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,822 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
[2024-11-07 23:55:42,833 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:42,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:42,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:42,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0
[2024-11-07 23:55:42,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,850 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,851 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
[2024-11-07 23:55:42,862 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:42,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:42,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:42,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:42,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:42,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:42,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:55:42,894 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver.
[2024-11-07 23:55:42,894 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero.
[2024-11-07 23:55:42,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:42,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:42,897 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:42,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process
[2024-11-07 23:55:42,900 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:55:42,914 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-07 23:55:42,914 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:55:42,914 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1
Supporting invariants []
[2024-11-07 23:55:42,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0
[2024-11-07 23:55:42,936 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed
[2024-11-07 23:55:42,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:42,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:42,982 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:43,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:43,014 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:43,054 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates
[2024-11-07 23:55:43,055 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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)
[2024-11-07 23:55:43,108 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 48 states and 60 transitions. Complement of second has 16 states.
[2024-11-07 23:55:43,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states
[2024-11-07 23:55:43,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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)
[2024-11-07 23:55:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions.
[2024-11-07 23:55:43,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 3 letters.
[2024-11-07 23:55:43,112 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:43,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 3 letters.
[2024-11-07 23:55:43,112 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:43,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 6 letters.
[2024-11-07 23:55:43,112 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:43,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions.
[2024-11-07 23:55:43,113 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-07 23:55:43,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 39 states and 51 transitions.
[2024-11-07 23:55:43,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29
[2024-11-07 23:55:43,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30
[2024-11-07 23:55:43,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions.
[2024-11-07 23:55:43,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:55:43,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions.
[2024-11-07 23:55:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions.
[2024-11-07 23:55:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37.
[2024-11-07 23:55:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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)
[2024-11-07 23:55:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions.
[2024-11-07 23:55:43,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions.
[2024-11-07 23:55:43,126 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 47 transitions.
[2024-11-07 23:55:43,126 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============
[2024-11-07 23:55:43,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions.
[2024-11-07 23:55:43,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-07 23:55:43,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:43,127 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:43,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:43,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:43,130 INFO L745 eck$LassoCheckResult]: Stem: 534#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 513#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 515#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 516#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 517#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 518#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 535#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 533#L40-4 havoc main_~i~1#1; 501#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 502#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 527#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 505#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 526#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 528#L24 assume ~n#1 < 2; 524#merge_sortFINAL assume true; 523#merge_sortEXIT >#88#return; 504#L27-1
[2024-11-07 23:55:43,130 INFO L747 eck$LassoCheckResult]: Loop: 504#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 525#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 537#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 506#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 525#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 537#L24 assume ~n#1 < 2; 514#merge_sortFINAL assume true; 536#merge_sortEXIT >#88#return; 504#L27-1
[2024-11-07 23:55:43,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:43,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1352366372, now seen corresponding path program 1 times
[2024-11-07 23:55:43,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:43,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373992683]
[2024-11-07 23:55:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:43,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:43,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:43,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:43,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1121289573, now seen corresponding path program 1 times
[2024-11-07 23:55:43,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:43,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379415804]
[2024-11-07 23:55:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:43,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:43,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:43,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash -526901058, now seen corresponding path program 1 times
[2024-11-07 23:55:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:43,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864580834]
[2024-11-07 23:55:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:43,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:43,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-07 23:55:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:43,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-07 23:55:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 23:55:43,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:55:43,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864580834]
[2024-11-07 23:55:43,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864580834] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:55:43,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245960524]
[2024-11-07 23:55:43,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:43,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:55:43,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:43,541 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:55:43,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process
[2024-11-07 23:55:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:43,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:43,606 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:43,667 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:55:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 23:55:43,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245960524] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:55:43,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:55:43,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15
[2024-11-07 23:55:43,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588800529]
[2024-11-07 23:55:43,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:55:44,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:55:44,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-07 23:55:44,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2024-11-07 23:55:44,192 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. cyclomatic complexity: 15 Second operand has 15 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5)
[2024-11-07 23:55:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:55:44,418 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions.
[2024-11-07 23:55:44,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 93 transitions.
[2024-11-07 23:55:44,419 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25
[2024-11-07 23:55:44,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 88 transitions.
[2024-11-07 23:55:44,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57
[2024-11-07 23:55:44,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60
[2024-11-07 23:55:44,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 88 transitions.
[2024-11-07 23:55:44,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:55:44,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 88 transitions.
[2024-11-07 23:55:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 88 transitions.
[2024-11-07 23:55:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67.
[2024-11-07 23:55:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 56 states have internal predecessors, (68), 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)
[2024-11-07 23:55:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions.
[2024-11-07 23:55:44,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 83 transitions.
[2024-11-07 23:55:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-07 23:55:44,433 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 83 transitions.
[2024-11-07 23:55:44,433 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============
[2024-11-07 23:55:44,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions.
[2024-11-07 23:55:44,434 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24
[2024-11-07 23:55:44,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:44,434 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:44,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:44,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:44,435 INFO L745 eck$LassoCheckResult]: Stem: 835#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 808#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 809#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 811#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 812#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 813#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 814#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 861#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 851#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 850#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 849#L40-4 havoc main_~i~1#1; 802#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 844#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 828#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 804#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 823#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 827#L24 assume ~n#1 < 2; 832#merge_sortFINAL assume true; 819#merge_sortEXIT >#88#return; 803#L27-1
[2024-11-07 23:55:44,435 INFO L747 eck$LassoCheckResult]: Loop: 803#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 822#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 860#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 801#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 822#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 860#L24 assume ~n#1 < 2; 820#merge_sortFINAL assume true; 821#merge_sortEXIT >#88#return; 803#L27-1
[2024-11-07 23:55:44,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1854838534, now seen corresponding path program 2 times
[2024-11-07 23:55:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:44,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531314834]
[2024-11-07 23:55:44,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:44,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:44,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:44,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1121289573, now seen corresponding path program 2 times
[2024-11-07 23:55:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:44,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216285958]
[2024-11-07 23:55:44,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:44,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:44,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:44,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash 8928416, now seen corresponding path program 2 times
[2024-11-07 23:55:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:44,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883239347]
[2024-11-07 23:55:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:44,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:44,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:44,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:45,681 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:55:45,682 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:55:45,682 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:55:45,682 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:55:45,682 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:55:45,682 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:45,682 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:55:45,682 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:55:45,682 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso
[2024-11-07 23:55:45,682 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:55:45,682 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:55:45,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:45,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:46,274 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:55:46,274 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:55:46,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:46,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:46,277 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:46,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process
[2024-11-07 23:55:46,278 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
[2024-11-07 23:55:46,287 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:46,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:46,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:46,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:46,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:46,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:46,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:46,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:46,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0
[2024-11-07 23:55:46,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:46,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:46,301 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:46,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process
[2024-11-07 23:55:46,302 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
[2024-11-07 23:55:46,312 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:46,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:46,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:46,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:46,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:46,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:46,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:46,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:46,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0
[2024-11-07 23:55:46,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:46,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:46,329 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:46,330 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
[2024-11-07 23:55:46,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process
[2024-11-07 23:55:46,340 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:46,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:46,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:46,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:46,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:46,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:46,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:46,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0
[2024-11-07 23:55:46,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:46,357 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:46,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process
[2024-11-07 23:55:46,360 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
[2024-11-07 23:55:46,373 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:46,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:46,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:46,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:46,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:46,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:46,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:55:46,418 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver.
[2024-11-07 23:55:46,418 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero.
[2024-11-07 23:55:46,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:46,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:46,420 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:46,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process
[2024-11-07 23:55:46,421 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:55:46,433 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-07 23:55:46,433 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:55:46,433 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_~m~0#1, merge_sort_~n#1) = -1*merge_sort_~m~0#1 + 1*merge_sort_~n#1
Supporting invariants []
[2024-11-07 23:55:46,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0
[2024-11-07 23:55:46,446 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed
[2024-11-07 23:55:46,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:46,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:46,485 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:46,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:46,550 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:46,604 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates
[2024-11-07 23:55:46,605 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 23 Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 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)
[2024-11-07 23:55:46,744 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 23. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 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 194 states and 262 transitions. Complement of second has 28 states.
[2024-11-07 23:55:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states
[2024-11-07 23:55:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 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)
[2024-11-07 23:55:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions.
[2024-11-07 23:55:46,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 19 letters. Loop has 8 letters.
[2024-11-07 23:55:46,748 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:46,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 27 letters. Loop has 8 letters.
[2024-11-07 23:55:46,748 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:46,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 19 letters. Loop has 16 letters.
[2024-11-07 23:55:46,749 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:46,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 262 transitions.
[2024-11-07 23:55:46,755 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 48
[2024-11-07 23:55:46,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 181 states and 249 transitions.
[2024-11-07 23:55:46,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115
[2024-11-07 23:55:46,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118
[2024-11-07 23:55:46,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 249 transitions.
[2024-11-07 23:55:46,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:55:46,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 249 transitions.
[2024-11-07 23:55:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 249 transitions.
[2024-11-07 23:55:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161.
[2024-11-07 23:55:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 131 states have (on average 1.282442748091603) internal successors, (168), 132 states have internal predecessors, (168), 19 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22)
[2024-11-07 23:55:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 211 transitions.
[2024-11-07 23:55:46,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 211 transitions.
[2024-11-07 23:55:46,784 INFO L425 stractBuchiCegarLoop]: Abstraction has 161 states and 211 transitions.
[2024-11-07 23:55:46,784 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============
[2024-11-07 23:55:46,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 211 transitions.
[2024-11-07 23:55:46,786 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 48
[2024-11-07 23:55:46,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:46,786 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:46,786 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:46,786 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2024-11-07 23:55:46,787 INFO L745 eck$LassoCheckResult]: Stem: 1260#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1215#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1216#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1219#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 1220#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1221#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 1222#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1285#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1259#L40-4 havoc main_~i~1#1; 1196#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1197#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1316#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1311#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1312#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1317#L24 assume ~n#1 < 2; 1315#merge_sortFINAL assume true; 1310#merge_sortEXIT >#88#return; 1304#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1305#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1309#L24 assume ~n#1 < 2; 1308#merge_sortFINAL assume true; 1303#merge_sortEXIT >#90#return; 1301#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1298#L11-3
[2024-11-07 23:55:46,787 INFO L747 eck$LassoCheckResult]: Loop: 1298#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1299#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 1302#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 1300#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1298#L11-3
[2024-11-07 23:55:46,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 178168560, now seen corresponding path program 1 times
[2024-11-07 23:55:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:46,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243165346]
[2024-11-07 23:55:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:46,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:46,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:46,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times
[2024-11-07 23:55:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416957609]
[2024-11-07 23:55:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:46,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:46,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:46,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:46,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2084911979, now seen corresponding path program 1 times
[2024-11-07 23:55:46,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:46,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86017923]
[2024-11-07 23:55:46,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:46,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:46,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0
[2024-11-07 23:55:46,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-07 23:55:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:46,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 23:55:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-07 23:55:46,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:55:47,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86017923]
[2024-11-07 23:55:47,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86017923] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:55:47,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:55:47,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 23:55:47,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472035478]
[2024-11-07 23:55:47,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:55:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:55:47,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 23:55:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 23:55:47,086 INFO L87 Difference]: Start difference. First operand 161 states and 211 transitions. cyclomatic complexity: 68 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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)
[2024-11-07 23:55:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:55:47,172 INFO L93 Difference]: Finished difference Result 235 states and 314 transitions.
[2024-11-07 23:55:47,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 314 transitions.
[2024-11-07 23:55:47,177 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 82
[2024-11-07 23:55:47,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 235 states and 314 transitions.
[2024-11-07 23:55:47,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155
[2024-11-07 23:55:47,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155
[2024-11-07 23:55:47,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 314 transitions.
[2024-11-07 23:55:47,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:55:47,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 235 states and 314 transitions.
[2024-11-07 23:55:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 314 transitions.
[2024-11-07 23:55:47,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 197.
[2024-11-07 23:55:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 167 states have (on average 1.2574850299401197) internal successors, (210), 168 states have internal predecessors, (210), 19 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22)
[2024-11-07 23:55:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 253 transitions.
[2024-11-07 23:55:47,206 INFO L240 hiAutomatonCegarLoop]: Abstraction has 197 states and 253 transitions.
[2024-11-07 23:55:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 23:55:47,210 INFO L425 stractBuchiCegarLoop]: Abstraction has 197 states and 253 transitions.
[2024-11-07 23:55:47,211 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============
[2024-11-07 23:55:47,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 253 transitions.
[2024-11-07 23:55:47,212 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 72
[2024-11-07 23:55:47,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:47,212 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:47,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:47,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:47,213 INFO L745 eck$LassoCheckResult]: Stem: 1697#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1640#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1641#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1647#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 1648#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1649#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 1650#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1701#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1702#L40-4 havoc main_~i~1#1; 1612#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1613#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1737#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1733#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1734#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1738#L24 assume ~n#1 < 2; 1736#merge_sortFINAL assume true; 1732#merge_sortEXIT >#88#return; 1729#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1730#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1735#L24 assume ~n#1 < 2; 1731#merge_sortFINAL assume true; 1728#merge_sortEXIT >#90#return; 1727#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1721#L11-3
[2024-11-07 23:55:47,213 INFO L747 eck$LassoCheckResult]: Loop: 1721#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1722#L12 assume !(merge_~j~0#1 == merge_~n#1); 1746#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 1751#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 1752#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 1747#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 1739#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 1740#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1721#L11-3
[2024-11-07 23:55:47,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:47,214 INFO L85 PathProgramCache]: Analyzing trace with hash 178168560, now seen corresponding path program 2 times
[2024-11-07 23:55:47,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:47,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934406020]
[2024-11-07 23:55:47,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:47,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:47,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:47,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:47,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times
[2024-11-07 23:55:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:47,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585607709]
[2024-11-07 23:55:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:47,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:47,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:47,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1066528190, now seen corresponding path program 1 times
[2024-11-07 23:55:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:47,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849979197]
[2024-11-07 23:55:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:47,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:47,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:48,502 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:55:48,502 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:55:48,502 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:55:48,502 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:55:48,502 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:55:48,502 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:48,502 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:55:48,502 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:55:48,502 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso
[2024-11-07 23:55:48,502 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:55:48,502 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:55:48,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:48,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:49,372 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:55:49,372 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:55:49,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:49,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:49,375 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:49,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process
[2024-11-07 23:55:49,379 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
[2024-11-07 23:55:49,390 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:49,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:49,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:49,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:49,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:49,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:49,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:49,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:49,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:49,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:49,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:49,404 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:49,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process
[2024-11-07 23:55:49,405 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
[2024-11-07 23:55:49,415 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:49,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:49,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:49,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:49,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:49,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:49,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:49,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:49,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0
[2024-11-07 23:55:49,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:49,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:49,428 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:49,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process
[2024-11-07 23:55:49,430 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
[2024-11-07 23:55:49,442 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:49,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:49,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:49,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:49,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:49,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:49,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:49,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:49,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0
[2024-11-07 23:55:49,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:49,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:49,456 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:49,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process
[2024-11-07 23:55:49,457 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
[2024-11-07 23:55:49,467 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:49,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:49,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:49,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:49,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:49,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:49,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:49,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:49,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0
[2024-11-07 23:55:49,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:49,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:49,481 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:49,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process
[2024-11-07 23:55:49,483 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
[2024-11-07 23:55:49,492 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:49,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:49,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:49,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:49,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:49,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:49,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:49,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:49,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0
[2024-11-07 23:55:49,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:49,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:49,506 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:49,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process
[2024-11-07 23:55:49,507 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
[2024-11-07 23:55:49,516 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:49,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:49,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:49,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:49,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:49,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:49,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:49,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:49,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0
[2024-11-07 23:55:49,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:49,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:49,531 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:49,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process
[2024-11-07 23:55:49,532 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
[2024-11-07 23:55:49,542 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:49,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:49,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:49,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:49,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:49,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:49,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:49,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:49,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0
[2024-11-07 23:55:49,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:49,555 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:49,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process
[2024-11-07 23:55:49,557 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
[2024-11-07 23:55:49,567 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:49,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:49,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:49,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:49,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:49,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:49,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:49,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0
[2024-11-07 23:55:49,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:49,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:49,598 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:49,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process
[2024-11-07 23:55:49,600 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
[2024-11-07 23:55:49,610 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:49,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:49,610 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts
[2024-11-07 23:55:49,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:49,663 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications.
[2024-11-07 23:55:49,663 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added.
[2024-11-07 23:55:49,995 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:55:50,875 INFO L443 ModelExtractionUtils]: Simplification made 66 calls to the SMT solver.
[2024-11-07 23:55:50,875 INFO L444 ModelExtractionUtils]: 15 out of 100 variables were initially zero. Simplification set additionally 73 variables to zero.
[2024-11-07 23:55:50,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:50,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:50,878 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:50,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process
[2024-11-07 23:55:50,879 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:55:50,894 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 8.
[2024-11-07 23:55:50,894 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:55:50,894 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~a#1.offset, v_rep(select #length merge_sort_merge_~a#1.base)_1, merge_sort_merge_~k~0#1) = -1*merge_sort_merge_~a#1.offset + 2*v_rep(select #length merge_sort_merge_~a#1.base)_1 - 4*merge_sort_merge_~k~0#1
Supporting invariants [-1*merge_sort_merge_~a#1.offset + 1*merge_sort_merge_~x~0#1.offset - 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_1 + 8 >= 0, 1*v_rep(select #length merge_sort_#in~a#1.base)_3 + 4*merge_sort_merge_~i~0#1 + 1*merge_sort_merge_~x~0#1.offset - 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_1 >= 0]
[2024-11-07 23:55:50,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0
[2024-11-07 23:55:50,942 INFO L156 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed
[2024-11-07 23:55:50,948 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset
[2024-11-07 23:55:50,949 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-07 23:55:50,949 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-07 23:55:50,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:51,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 44 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:51,008 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:51,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2024-11-07 23:55:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:51,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:51,251 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:51,386 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates
[2024-11-07 23:55:51,386 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 197 states and 253 transitions. cyclomatic complexity: 74 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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)
[2024-11-07 23:55:51,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0
[2024-11-07 23:55:51,702 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 197 states and 253 transitions. cyclomatic complexity: 74. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 347 states and 476 transitions. Complement of second has 19 states.
[2024-11-07 23:55:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 4 non-accepting loop states 2 accepting loop states
[2024-11-07 23:55:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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)
[2024-11-07 23:55:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions.
[2024-11-07 23:55:51,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 23 letters. Loop has 8 letters.
[2024-11-07 23:55:51,704 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:51,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 31 letters. Loop has 8 letters.
[2024-11-07 23:55:51,705 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:51,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 23 letters. Loop has 16 letters.
[2024-11-07 23:55:51,705 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:51,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 347 states and 476 transitions.
[2024-11-07 23:55:51,714 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 90
[2024-11-07 23:55:51,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 347 states to 335 states and 460 transitions.
[2024-11-07 23:55:51,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184
[2024-11-07 23:55:51,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195
[2024-11-07 23:55:51,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 335 states and 460 transitions.
[2024-11-07 23:55:51,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:55:51,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 335 states and 460 transitions.
[2024-11-07 23:55:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states and 460 transitions.
[2024-11-07 23:55:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 247.
[2024-11-07 23:55:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 213 states have (on average 1.2863849765258215) internal successors, (274), 214 states have internal predecessors, (274), 21 states have call successors, (24), 15 states have call predecessors, (24), 13 states have return successors, (26), 17 states have call predecessors, (26), 19 states have call successors, (26)
[2024-11-07 23:55:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 324 transitions.
[2024-11-07 23:55:51,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 247 states and 324 transitions.
[2024-11-07 23:55:51,748 INFO L425 stractBuchiCegarLoop]: Abstraction has 247 states and 324 transitions.
[2024-11-07 23:55:51,748 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============
[2024-11-07 23:55:51,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 247 states and 324 transitions.
[2024-11-07 23:55:51,752 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 74
[2024-11-07 23:55:51,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:51,752 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:51,754 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:51,754 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:51,754 INFO L745 eck$LassoCheckResult]: Stem: 2440#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2380#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2381#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 2390#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 2391#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2392#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 2393#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2394#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2436#L40-4 havoc main_~i~1#1; 2428#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2492#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2490#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2486#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2487#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2491#L24 assume ~n#1 < 2; 2489#merge_sortFINAL assume true; 2485#merge_sortEXIT >#88#return; 2482#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2483#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2488#L24 assume ~n#1 < 2; 2484#merge_sortFINAL assume true; 2481#merge_sortEXIT >#90#return; 2480#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 2479#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2458#L12
[2024-11-07 23:55:51,754 INFO L747 eck$LassoCheckResult]: Loop: 2458#L12 assume !(merge_~j~0#1 == merge_~n#1); 2498#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 2496#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 2495#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 2494#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 2457#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2458#L12
[2024-11-07 23:55:51,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:51,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1228258079, now seen corresponding path program 1 times
[2024-11-07 23:55:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:51,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912724521]
[2024-11-07 23:55:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:51,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:51,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:51,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:51,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1482376367, now seen corresponding path program 1 times
[2024-11-07 23:55:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523300639]
[2024-11-07 23:55:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:51,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:51,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:51,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:51,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2045529779, now seen corresponding path program 1 times
[2024-11-07 23:55:51,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:51,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23410805]
[2024-11-07 23:55:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:51,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:51,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-07 23:55:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:51,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 23:55:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-07 23:55:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:55:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23410805]
[2024-11-07 23:55:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23410805] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:55:51,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:55:51,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 23:55:51,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128904380]
[2024-11-07 23:55:51,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:55:52,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:55:52,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 23:55:52,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 23:55:52,076 INFO L87 Difference]: Start difference. First operand 247 states and 324 transitions. cyclomatic complexity: 98 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)
[2024-11-07 23:55:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:55:52,174 INFO L93 Difference]: Finished difference Result 339 states and 453 transitions.
[2024-11-07 23:55:52,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 339 states and 453 transitions.
[2024-11-07 23:55:52,180 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 106
[2024-11-07 23:55:52,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 339 states to 339 states and 453 transitions.
[2024-11-07 23:55:52,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196
[2024-11-07 23:55:52,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196
[2024-11-07 23:55:52,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 339 states and 453 transitions.
[2024-11-07 23:55:52,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:55:52,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 339 states and 453 transitions.
[2024-11-07 23:55:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states and 453 transitions.
[2024-11-07 23:55:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 313.
[2024-11-07 23:55:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 279 states have (on average 1.2867383512544803) internal successors, (359), 280 states have internal predecessors, (359), 21 states have call successors, (24), 15 states have call predecessors, (24), 13 states have return successors, (26), 17 states have call predecessors, (26), 19 states have call successors, (26)
[2024-11-07 23:55:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 409 transitions.
[2024-11-07 23:55:52,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 313 states and 409 transitions.
[2024-11-07 23:55:52,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 23:55:52,207 INFO L425 stractBuchiCegarLoop]: Abstraction has 313 states and 409 transitions.
[2024-11-07 23:55:52,207 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============
[2024-11-07 23:55:52,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 409 transitions.
[2024-11-07 23:55:52,210 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 104
[2024-11-07 23:55:52,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:52,211 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:52,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:52,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:52,212 INFO L745 eck$LassoCheckResult]: Stem: 3049#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2987#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 2996#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 2997#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2998#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 2999#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3054#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 3055#L40-4 havoc main_~i~1#1; 2959#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2960#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3116#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 3112#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3113#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3117#L24 assume ~n#1 < 2; 3115#merge_sortFINAL assume true; 3111#merge_sortEXIT >#88#return; 3108#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 3109#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3114#L24 assume ~n#1 < 2; 3110#merge_sortFINAL assume true; 3107#merge_sortEXIT >#90#return; 3106#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 3104#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 3068#L12
[2024-11-07 23:55:52,212 INFO L747 eck$LassoCheckResult]: Loop: 3068#L12 assume !(merge_~j~0#1 == merge_~n#1); 3131#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 3130#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 3127#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 3128#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 3123#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 3124#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 3067#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 3068#L12
[2024-11-07 23:55:52,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1228258079, now seen corresponding path program 2 times
[2024-11-07 23:55:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:52,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934988863]
[2024-11-07 23:55:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:52,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:52,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:52,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times
[2024-11-07 23:55:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499957028]
[2024-11-07 23:55:52,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:52,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:52,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:52,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1354622765, now seen corresponding path program 1 times
[2024-11-07 23:55:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:52,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935554343]
[2024-11-07 23:55:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:52,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:52,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:52,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:53,422 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:55:53,423 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:55:53,423 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:55:53,423 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:55:53,423 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:55:53,423 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:53,423 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:55:53,423 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:55:53,423 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration10_Lasso
[2024-11-07 23:55:53,423 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:55:53,423 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:55:53,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:53,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:55:54,295 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:55:54,295 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:55:54,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,298 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,299 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
[2024-11-07 23:55:54,309 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:54,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:54,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:54,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0
[2024-11-07 23:55:54,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,322 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,324 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
[2024-11-07 23:55:54,333 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:54,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:54,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:54,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0
[2024-11-07 23:55:54,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,348 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,350 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
[2024-11-07 23:55:54,359 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:54,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:54,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:54,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0
[2024-11-07 23:55:54,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,373 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,374 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
[2024-11-07 23:55:54,383 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:55:54,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:55:54,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:55:54,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0
[2024-11-07 23:55:54,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,398 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,399 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
[2024-11-07 23:55:54,409 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:54,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:54,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0
[2024-11-07 23:55:54,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,426 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,427 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
[2024-11-07 23:55:54,437 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:54,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:54,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0
[2024-11-07 23:55:54,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,459 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,460 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
[2024-11-07 23:55:54,470 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:54,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:54,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0
[2024-11-07 23:55:54,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,487 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,488 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
[2024-11-07 23:55:54,498 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:54,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:54,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0
[2024-11-07 23:55:54,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,513 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,514 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
[2024-11-07 23:55:54,524 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:54,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:54,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0
[2024-11-07 23:55:54,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,539 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,540 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
[2024-11-07 23:55:54,550 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:54,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:54,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0
[2024-11-07 23:55:54,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,567 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,568 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
[2024-11-07 23:55:54,578 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:54,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:54,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0
[2024-11-07 23:55:54,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,594 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,596 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
[2024-11-07 23:55:54,606 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:54,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:54,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0
[2024-11-07 23:55:54,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,624 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,625 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
[2024-11-07 23:55:54,635 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:55:54,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:55:54,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:55:54,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:55:54,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0
[2024-11-07 23:55:54,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:54,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:54,651 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:54,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process
[2024-11-07 23:55:54,653 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
[2024-11-07 23:55:54,663 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:55:54,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:55:54,664 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts
[2024-11-07 23:55:54,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:55:54,715 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications.
[2024-11-07 23:55:54,715 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added.
[2024-11-07 23:55:55,028 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:55:56,054 INFO L443 ModelExtractionUtils]: Simplification made 87 calls to the SMT solver.
[2024-11-07 23:55:56,055 INFO L444 ModelExtractionUtils]: 20 out of 100 variables were initially zero. Simplification set additionally 71 variables to zero.
[2024-11-07 23:55:56,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:55:56,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:56,057 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:55:56,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process
[2024-11-07 23:55:56,058 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:55:56,073 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 8.
[2024-11-07 23:55:56,073 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:55:56,073 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~k~0#1, merge_sort_merge_~a#1.offset, v_rep(select #length merge_sort_merge_~a#1.base)_2) = -4*merge_sort_merge_~k~0#1 - 1*merge_sort_merge_~a#1.offset + 2*v_rep(select #length merge_sort_merge_~a#1.base)_2
Supporting invariants [1*v_rep(select #length merge_sort_#in~a#1.base)_4 + 2*merge_sort_merge_~i~0#1 - 2*merge_sort_merge_~n#1 >= 0, 1*merge_sort_merge_~j~0#1 - 1*merge_sort_merge_~k~0#1 >= 0]
[2024-11-07 23:55:56,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0
[2024-11-07 23:55:56,113 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed
[2024-11-07 23:55:56,115 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset
[2024-11-07 23:55:56,115 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-07 23:55:56,115 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-07 23:55:56,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:56,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:56,169 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:56,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0
[2024-11-07 23:55:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:56,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:56,348 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:56,461 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 4 loop predicates
[2024-11-07 23:55:56,461 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 313 states and 409 transitions. cyclomatic complexity: 119 Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 23:55:56,722 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 313 states and 409 transitions. cyclomatic complexity: 119. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Result 685 states and 877 transitions. Complement of second has 27 states.
[2024-11-07 23:55:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 6 stem states 3 non-accepting loop states 2 accepting loop states
[2024-11-07 23:55:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 23:55:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions.
[2024-11-07 23:55:56,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 44 transitions. Stem has 24 letters. Loop has 8 letters.
[2024-11-07 23:55:56,725 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:56,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 44 transitions. Stem has 32 letters. Loop has 8 letters.
[2024-11-07 23:55:56,725 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:56,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 44 transitions. Stem has 24 letters. Loop has 16 letters.
[2024-11-07 23:55:56,725 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:55:56,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 685 states and 877 transitions.
[2024-11-07 23:55:56,737 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 122
[2024-11-07 23:55:56,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 685 states to 565 states and 747 transitions.
[2024-11-07 23:55:56,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254
[2024-11-07 23:55:56,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285
[2024-11-07 23:55:56,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 565 states and 747 transitions.
[2024-11-07 23:55:56,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:55:56,748 INFO L218 hiAutomatonCegarLoop]: Abstraction has 565 states and 747 transitions.
[2024-11-07 23:55:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states and 747 transitions.
[2024-11-07 23:55:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 474.
[2024-11-07 23:55:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 419 states have (on average 1.279236276849642) internal successors, (536), 420 states have internal predecessors, (536), 35 states have call successors, (39), 22 states have call predecessors, (39), 20 states have return successors, (62), 31 states have call predecessors, (62), 33 states have call successors, (62)
[2024-11-07 23:55:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 637 transitions.
[2024-11-07 23:55:56,772 INFO L240 hiAutomatonCegarLoop]: Abstraction has 474 states and 637 transitions.
[2024-11-07 23:55:56,772 INFO L425 stractBuchiCegarLoop]: Abstraction has 474 states and 637 transitions.
[2024-11-07 23:55:56,772 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============
[2024-11-07 23:55:56,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 474 states and 637 transitions.
[2024-11-07 23:55:56,776 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 118
[2024-11-07 23:55:56,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:56,776 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:56,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:56,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:55:56,778 INFO L745 eck$LassoCheckResult]: Stem: 4273#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4200#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 4208#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 4209#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4210#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 4211#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4276#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 4277#L40-4 havoc main_~i~1#1; 4171#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 4172#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4395#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 4391#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4392#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4396#L24 assume ~n#1 < 2; 4394#merge_sortFINAL assume true; 4390#merge_sortEXIT >#88#return; 4387#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4388#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4393#L24 assume ~n#1 < 2; 4389#merge_sortFINAL assume true; 4386#merge_sortEXIT >#90#return; 4385#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 4383#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 4264#L11-4 merge_~i~0#1 := 0; 4248#L17-3
[2024-11-07 23:55:56,778 INFO L747 eck$LassoCheckResult]: Loop: 4248#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 4247#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 4248#L17-3
[2024-11-07 23:55:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash -578705235, now seen corresponding path program 1 times
[2024-11-07 23:55:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:56,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707879784]
[2024-11-07 23:55:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:56,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-07 23:55:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 23:55:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-07 23:55:56,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:55:56,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707879784]
[2024-11-07 23:55:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707879784] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:55:56,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:55:56,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 23:55:56,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223045947]
[2024-11-07 23:55:56,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:55:56,872 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:55:56,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:56,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times
[2024-11-07 23:55:56,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:56,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36726097]
[2024-11-07 23:55:56,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:56,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:56,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:56,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:55:56,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 23:55:56,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 23:55:56,942 INFO L87 Difference]: Start difference. First operand 474 states and 637 transitions. cyclomatic complexity: 204 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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)
[2024-11-07 23:55:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:55:57,006 INFO L93 Difference]: Finished difference Result 574 states and 736 transitions.
[2024-11-07 23:55:57,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 574 states and 736 transitions.
[2024-11-07 23:55:57,013 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 110
[2024-11-07 23:55:57,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 574 states to 574 states and 736 transitions.
[2024-11-07 23:55:57,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253
[2024-11-07 23:55:57,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253
[2024-11-07 23:55:57,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 574 states and 736 transitions.
[2024-11-07 23:55:57,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:55:57,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 574 states and 736 transitions.
[2024-11-07 23:55:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states and 736 transitions.
[2024-11-07 23:55:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 446.
[2024-11-07 23:55:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 392 states have (on average 1.25) internal successors, (490), 396 states have internal predecessors, (490), 32 states have call successors, (36), 21 states have call predecessors, (36), 22 states have return successors, (58), 28 states have call predecessors, (58), 30 states have call successors, (58)
[2024-11-07 23:55:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 584 transitions.
[2024-11-07 23:55:57,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 446 states and 584 transitions.
[2024-11-07 23:55:57,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 23:55:57,047 INFO L425 stractBuchiCegarLoop]: Abstraction has 446 states and 584 transitions.
[2024-11-07 23:55:57,047 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============
[2024-11-07 23:55:57,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 446 states and 584 transitions.
[2024-11-07 23:55:57,050 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 108
[2024-11-07 23:55:57,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:57,051 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:57,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:57,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-07 23:55:57,053 INFO L745 eck$LassoCheckResult]: Stem: 5344#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 5276#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 5283#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 5284#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5285#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 5286#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5287#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 5351#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5349#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 5350#L40-4 havoc main_~i~1#1; 5237#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 5238#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5446#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 5247#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5440#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5579#L24 assume ~n#1 < 2; 5578#merge_sortFINAL assume true; 5439#merge_sortEXIT >#88#return; 5246#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 5438#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5435#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 5280#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5473#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5474#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 5264#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5483#$Ultimate##0
[2024-11-07 23:55:57,053 INFO L747 eck$LassoCheckResult]: Loop: 5483#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5485#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 5262#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5483#$Ultimate##0
[2024-11-07 23:55:57,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1524308723, now seen corresponding path program 3 times
[2024-11-07 23:55:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411394794]
[2024-11-07 23:55:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-07 23:55:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:55:57,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411394794]
[2024-11-07 23:55:57,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411394794] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:55:57,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461723498]
[2024-11-07 23:55:57,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 23:55:57,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:55:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:57,438 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:55:57,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process
[2024-11-07 23:55:57,512 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2024-11-07 23:55:57,512 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:55:57,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:57,515 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:57,578 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:55:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:55:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461723498] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:55:57,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:55:57,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 25
[2024-11-07 23:55:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263995683]
[2024-11-07 23:55:57,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:55:57,751 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:55:57,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 4 times
[2024-11-07 23:55:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482426206]
[2024-11-07 23:55:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:57,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:57,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:55:57,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-11-07 23:55:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600
[2024-11-07 23:55:57,890 INFO L87 Difference]: Start difference. First operand 446 states and 584 transitions. cyclomatic complexity: 173 Second operand has 25 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-07 23:55:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:55:58,306 INFO L93 Difference]: Finished difference Result 766 states and 993 transitions.
[2024-11-07 23:55:58,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 766 states and 993 transitions.
[2024-11-07 23:55:58,314 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 204
[2024-11-07 23:55:58,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 766 states to 758 states and 984 transitions.
[2024-11-07 23:55:58,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402
[2024-11-07 23:55:58,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416
[2024-11-07 23:55:58,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 758 states and 984 transitions.
[2024-11-07 23:55:58,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:55:58,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 758 states and 984 transitions.
[2024-11-07 23:55:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states and 984 transitions.
[2024-11-07 23:55:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 684.
[2024-11-07 23:55:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 602 states have (on average 1.2458471760797343) internal successors, (750), 606 states have internal predecessors, (750), 48 states have call successors, (55), 35 states have call predecessors, (55), 34 states have return successors, (78), 42 states have call predecessors, (78), 44 states have call successors, (78)
[2024-11-07 23:55:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 883 transitions.
[2024-11-07 23:55:58,347 INFO L240 hiAutomatonCegarLoop]: Abstraction has 684 states and 883 transitions.
[2024-11-07 23:55:58,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2024-11-07 23:55:58,349 INFO L425 stractBuchiCegarLoop]: Abstraction has 684 states and 883 transitions.
[2024-11-07 23:55:58,349 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============
[2024-11-07 23:55:58,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 684 states and 883 transitions.
[2024-11-07 23:55:58,352 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 186
[2024-11-07 23:55:58,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:58,352 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:58,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:58,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-07 23:55:58,353 INFO L745 eck$LassoCheckResult]: Stem: 6756#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6680#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 6681#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 6693#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 6694#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6695#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 6696#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6697#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 6765#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6802#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 6801#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6800#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 6751#L40-4 havoc main_~i~1#1; 6665#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 6805#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6804#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 6715#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6716#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6787#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 6780#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6790#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6788#L24 assume ~n#1 < 2; 6789#merge_sortFINAL assume true; 6783#merge_sortEXIT >#88#return; 6736#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 6738#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6777#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 6673#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6849#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7029#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 7027#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7028#$Ultimate##0
[2024-11-07 23:55:58,353 INFO L747 eck$LassoCheckResult]: Loop: 7028#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7034#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 7032#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7028#$Ultimate##0
[2024-11-07 23:55:58,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:58,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1652352750, now seen corresponding path program 4 times
[2024-11-07 23:55:58,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:58,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465677211]
[2024-11-07 23:55:58,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:58,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 23:55:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:55:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-07 23:55:58,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:55:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465677211]
[2024-11-07 23:55:58,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465677211] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:55:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720004435]
[2024-11-07 23:55:58,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-07 23:55:58,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:55:58,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:55:58,701 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:55:58,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process
[2024-11-07 23:55:58,784 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-07 23:55:58,784 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:55:58,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:55:58,790 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:55:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-07 23:55:58,880 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:55:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-07 23:55:59,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720004435] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:55:59,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:55:59,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 26
[2024-11-07 23:55:59,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188548154]
[2024-11-07 23:55:59,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:55:59,050 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:55:59,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:59,050 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 5 times
[2024-11-07 23:55:59,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:59,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412290407]
[2024-11-07 23:55:59,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:59,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:59,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:59,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:59,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:55:59,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-07 23:55:59,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650
[2024-11-07 23:55:59,189 INFO L87 Difference]: Start difference. First operand 684 states and 883 transitions. cyclomatic complexity: 246 Second operand has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 10 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-07 23:55:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:55:59,807 INFO L93 Difference]: Finished difference Result 692 states and 889 transitions.
[2024-11-07 23:55:59,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 889 transitions.
[2024-11-07 23:55:59,814 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 268
[2024-11-07 23:55:59,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 677 states and 873 transitions.
[2024-11-07 23:55:59,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 502
[2024-11-07 23:55:59,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 511
[2024-11-07 23:55:59,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 677 states and 873 transitions.
[2024-11-07 23:55:59,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:55:59,825 INFO L218 hiAutomatonCegarLoop]: Abstraction has 677 states and 873 transitions.
[2024-11-07 23:55:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states and 873 transitions.
[2024-11-07 23:55:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 577.
[2024-11-07 23:55:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 514 states have (on average 1.2412451361867705) internal successors, (638), 512 states have internal predecessors, (638), 39 states have call successors, (43), 33 states have call predecessors, (43), 24 states have return successors, (61), 31 states have call predecessors, (61), 34 states have call successors, (61)
[2024-11-07 23:55:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 742 transitions.
[2024-11-07 23:55:59,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 577 states and 742 transitions.
[2024-11-07 23:55:59,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2024-11-07 23:55:59,845 INFO L425 stractBuchiCegarLoop]: Abstraction has 577 states and 742 transitions.
[2024-11-07 23:55:59,845 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============
[2024-11-07 23:55:59,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 577 states and 742 transitions.
[2024-11-07 23:55:59,848 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 200
[2024-11-07 23:55:59,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:55:59,849 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:55:59,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:59,849 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:55:59,849 INFO L745 eck$LassoCheckResult]: Stem: 8364#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8306#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8307#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 8309#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 8310#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8311#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 8312#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8373#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 8374#L40-4 havoc main_~i~1#1; 8336#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 8434#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8432#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 8418#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 8422#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8430#L24 assume ~n#1 < 2; 8429#merge_sortFINAL assume true; 8417#merge_sortEXIT >#88#return; 8412#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 8413#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8425#L24 assume ~n#1 < 2; 8426#merge_sortFINAL assume true; 8411#merge_sortEXIT >#90#return; 8409#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 8406#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8407#L12 assume !(merge_~j~0#1 == merge_~n#1); 8442#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 8443#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 8402#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 8394#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 8392#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 8393#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 8387#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8389#L12
[2024-11-07 23:55:59,849 INFO L747 eck$LassoCheckResult]: Loop: 8389#L12 assume !(merge_~j~0#1 == merge_~n#1); 8850#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 8857#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 8858#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 8853#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 8854#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8389#L12
[2024-11-07 23:55:59,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1297364463, now seen corresponding path program 2 times
[2024-11-07 23:55:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:59,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119363190]
[2024-11-07 23:55:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:59,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:59,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:59,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1482376367, now seen corresponding path program 2 times
[2024-11-07 23:55:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474542208]
[2024-11-07 23:55:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:59,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:55:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:55:59,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:55:59,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:55:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash 401294015, now seen corresponding path program 1 times
[2024-11-07 23:55:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:55:59,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610440415]
[2024-11-07 23:55:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:55:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:55:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-07 23:56:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 23:56:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 23:56:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:56:00,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610440415]
[2024-11-07 23:56:00,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610440415] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:56:00,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821288544]
[2024-11-07 23:56:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:00,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:56:00,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:00,055 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:56:00,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process
[2024-11-07 23:56:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:00,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:00,173 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 23:56:00,273 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:56:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 23:56:00,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821288544] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:56:00,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:56:00,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16
[2024-11-07 23:56:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851385380]
[2024-11-07 23:56:00,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:56:00,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:56:00,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-07 23:56:00,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272
[2024-11-07 23:56:00,434 INFO L87 Difference]: Start difference. First operand 577 states and 742 transitions. cyclomatic complexity: 200 Second operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 15 states have internal predecessors, (59), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 23:56:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:56:00,630 INFO L93 Difference]: Finished difference Result 652 states and 824 transitions.
[2024-11-07 23:56:00,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 652 states and 824 transitions.
[2024-11-07 23:56:00,637 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 202
[2024-11-07 23:56:00,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 652 states to 638 states and 810 transitions.
[2024-11-07 23:56:00,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 429
[2024-11-07 23:56:00,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 472
[2024-11-07 23:56:00,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 638 states and 810 transitions.
[2024-11-07 23:56:00,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:00,644 INFO L218 hiAutomatonCegarLoop]: Abstraction has 638 states and 810 transitions.
[2024-11-07 23:56:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states and 810 transitions.
[2024-11-07 23:56:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 614.
[2024-11-07 23:56:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 551 states have (on average 1.2377495462794919) internal successors, (682), 548 states have internal predecessors, (682), 39 states have call successors, (43), 33 states have call predecessors, (43), 24 states have return successors, (61), 32 states have call predecessors, (61), 34 states have call successors, (61)
[2024-11-07 23:56:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 786 transitions.
[2024-11-07 23:56:00,663 INFO L240 hiAutomatonCegarLoop]: Abstraction has 614 states and 786 transitions.
[2024-11-07 23:56:00,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-07 23:56:00,664 INFO L425 stractBuchiCegarLoop]: Abstraction has 614 states and 786 transitions.
[2024-11-07 23:56:00,664 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============
[2024-11-07 23:56:00,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 614 states and 786 transitions.
[2024-11-07 23:56:00,667 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 200
[2024-11-07 23:56:00,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:00,668 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:00,670 INFO L148 hiAutomatonCegarLoop]: 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, 1]
[2024-11-07 23:56:00,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:56:00,671 INFO L745 eck$LassoCheckResult]: Stem: 9853#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9797#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 9798#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 9800#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 9801#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9802#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 9803#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9860#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 9861#L40-4 havoc main_~i~1#1; 9783#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 9784#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10068#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 9816#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 10060#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10122#L24 assume ~n#1 < 2; 10059#merge_sortFINAL assume true; 9815#merge_sortEXIT >#88#return; 9817#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 9841#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9842#L24 assume ~n#1 < 2; 9843#merge_sortFINAL assume true; 10049#merge_sortEXIT >#90#return; 10050#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 10315#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 10314#L12 assume !(merge_~j~0#1 == merge_~n#1); 10313#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 10311#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 10312#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 10361#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 10360#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 10359#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 10357#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 9849#L11-4 merge_~i~0#1 := 0; 9840#L17-3
[2024-11-07 23:56:00,671 INFO L747 eck$LassoCheckResult]: Loop: 9840#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 9839#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 9840#L17-3
[2024-11-07 23:56:00,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1563592709, now seen corresponding path program 1 times
[2024-11-07 23:56:00,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:00,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794273203]
[2024-11-07 23:56:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:00,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-07 23:56:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:00,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 23:56:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-07 23:56:00,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:56:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794273203]
[2024-11-07 23:56:00,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794273203] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:56:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010269711]
[2024-11-07 23:56:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:00,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:56:00,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:00,759 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:56:00,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process
[2024-11-07 23:56:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:00,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:00,851 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-07 23:56:00,898 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:56:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-07 23:56:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010269711] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:56:00,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:56:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-11-07 23:56:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824420253]
[2024-11-07 23:56:00,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:56:00,940 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:56:00,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times
[2024-11-07 23:56:00,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:00,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414792070]
[2024-11-07 23:56:00,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:00,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:00,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:01,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:56:01,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 23:56:01,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-11-07 23:56:01,002 INFO L87 Difference]: Start difference. First operand 614 states and 786 transitions. cyclomatic complexity: 207 Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 23:56:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:56:01,077 INFO L93 Difference]: Finished difference Result 1038 states and 1266 transitions.
[2024-11-07 23:56:01,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1038 states and 1266 transitions.
[2024-11-07 23:56:01,084 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 200
[2024-11-07 23:56:01,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1038 states to 1038 states and 1266 transitions.
[2024-11-07 23:56:01,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 677
[2024-11-07 23:56:01,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 677
[2024-11-07 23:56:01,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1038 states and 1266 transitions.
[2024-11-07 23:56:01,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:01,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1038 states and 1266 transitions.
[2024-11-07 23:56:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states and 1266 transitions.
[2024-11-07 23:56:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 764.
[2024-11-07 23:56:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 701 states have (on average 1.2111269614835949) internal successors, (849), 698 states have internal predecessors, (849), 39 states have call successors, (43), 33 states have call predecessors, (43), 24 states have return successors, (61), 32 states have call predecessors, (61), 34 states have call successors, (61)
[2024-11-07 23:56:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 953 transitions.
[2024-11-07 23:56:01,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 764 states and 953 transitions.
[2024-11-07 23:56:01,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 23:56:01,127 INFO L425 stractBuchiCegarLoop]: Abstraction has 764 states and 953 transitions.
[2024-11-07 23:56:01,128 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============
[2024-11-07 23:56:01,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 764 states and 953 transitions.
[2024-11-07 23:56:01,131 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 200
[2024-11-07 23:56:01,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:01,131 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:01,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:01,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:01,132 INFO L745 eck$LassoCheckResult]: Stem: 11725#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 11666#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 11671#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 11672#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 11673#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 11674#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 11736#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 11675#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 11676#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 11742#L40-4 havoc main_~i~1#1; 11649#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 11650#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11991#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 11988#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 11989#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11992#L24 assume ~n#1 < 2; 11990#merge_sortFINAL assume true; 11987#merge_sortEXIT >#88#return; 11668#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 11986#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12139#L24 assume ~n#1 < 2; 12138#merge_sortFINAL assume true; 11682#merge_sortEXIT >#90#return; 11683#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 12272#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12273#L12 assume !(merge_~j~0#1 == merge_~n#1); 12285#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 12283#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 12282#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 12281#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 12280#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 12279#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12278#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 11884#L12
[2024-11-07 23:56:01,133 INFO L747 eck$LassoCheckResult]: Loop: 11884#L12 assume !(merge_~j~0#1 == merge_~n#1); 12391#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 12399#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 12397#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 12398#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12392#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 11884#L12
[2024-11-07 23:56:01,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash 960556015, now seen corresponding path program 3 times
[2024-11-07 23:56:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:01,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203311360]
[2024-11-07 23:56:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:01,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-07 23:56:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:01,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 23:56:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-07 23:56:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:56:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203311360]
[2024-11-07 23:56:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203311360] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:56:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794664210]
[2024-11-07 23:56:01,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 23:56:01,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:56:01,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:01,299 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:56:01,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process
[2024-11-07 23:56:01,396 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2024-11-07 23:56:01,396 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:56:01,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:01,398 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-07 23:56:01,457 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:56:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-07 23:56:01,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794664210] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:56:01,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:56:01,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16
[2024-11-07 23:56:01,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192652769]
[2024-11-07 23:56:01,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:56:01,563 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:56:01,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1482376367, now seen corresponding path program 3 times
[2024-11-07 23:56:01,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:01,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853833446]
[2024-11-07 23:56:01,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:01,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:01,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:01,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:01,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:56:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-07 23:56:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240
[2024-11-07 23:56:01,649 INFO L87 Difference]: Start difference. First operand 764 states and 953 transitions. cyclomatic complexity: 224 Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-07 23:56:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:56:01,896 INFO L93 Difference]: Finished difference Result 680 states and 842 transitions.
[2024-11-07 23:56:01,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 680 states and 842 transitions.
[2024-11-07 23:56:01,900 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 226
[2024-11-07 23:56:01,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 680 states to 654 states and 815 transitions.
[2024-11-07 23:56:01,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 587
[2024-11-07 23:56:01,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 587
[2024-11-07 23:56:01,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 654 states and 815 transitions.
[2024-11-07 23:56:01,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:01,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 654 states and 815 transitions.
[2024-11-07 23:56:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states and 815 transitions.
[2024-11-07 23:56:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 536.
[2024-11-07 23:56:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 475 states have (on average 1.2) internal successors, (570), 474 states have internal predecessors, (570), 41 states have call successors, (42), 30 states have call predecessors, (42), 20 states have return successors, (61), 31 states have call predecessors, (61), 36 states have call successors, (61)
[2024-11-07 23:56:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 673 transitions.
[2024-11-07 23:56:01,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 536 states and 673 transitions.
[2024-11-07 23:56:01,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2024-11-07 23:56:01,919 INFO L425 stractBuchiCegarLoop]: Abstraction has 536 states and 673 transitions.
[2024-11-07 23:56:01,919 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============
[2024-11-07 23:56:01,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 536 states and 673 transitions.
[2024-11-07 23:56:01,922 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 158
[2024-11-07 23:56:01,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:01,922 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:01,925 INFO L148 hiAutomatonCegarLoop]: 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, 1]
[2024-11-07 23:56:01,925 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:56:01,925 INFO L745 eck$LassoCheckResult]: Stem: 13405#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13354#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 13355#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 13357#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 13358#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 13359#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 13360#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 13414#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 13415#L40-4 havoc main_~i~1#1; 13336#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 13337#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13497#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 13498#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 13499#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13583#L24 assume ~n#1 < 2; 13582#merge_sortFINAL assume true; 13581#merge_sortEXIT >#88#return; 13382#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 13381#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13383#L24 assume ~n#1 < 2; 13691#merge_sortFINAL assume true; 13685#merge_sortEXIT >#90#return; 13686#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 13841#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13840#L12 assume !(merge_~j~0#1 == merge_~n#1); 13839#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 13837#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 13836#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 13835#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 13834#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 13833#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 13831#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13828#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 13829#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 13866#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 13433#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 13400#L11-4 merge_~i~0#1 := 0; 13391#L17-3
[2024-11-07 23:56:01,925 INFO L747 eck$LassoCheckResult]: Loop: 13391#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 13390#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 13391#L17-3
[2024-11-07 23:56:01,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash -412481570, now seen corresponding path program 1 times
[2024-11-07 23:56:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:01,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447391754]
[2024-11-07 23:56:01,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:01,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:01,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:01,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:01,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:01,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times
[2024-11-07 23:56:01,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:01,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958521319]
[2024-11-07 23:56:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:01,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:01,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:01,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1257795936, now seen corresponding path program 1 times
[2024-11-07 23:56:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:01,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137543806]
[2024-11-07 23:56:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:01,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:02,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:02,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:03,843 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:56:03,844 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:56:03,844 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:56:03,844 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:56:03,844 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:56:03,844 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:03,844 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:56:03,844 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:56:03,844 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration17_Lasso
[2024-11-07 23:56:03,844 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:56:03,844 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:56:03,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:03,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:04,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:04,657 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:56:04,657 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:56:04,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,659 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,661 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
[2024-11-07 23:56:04,671 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0
[2024-11-07 23:56:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,684 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,686 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
[2024-11-07 23:56:04,695 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0
[2024-11-07 23:56:04,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,709 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,710 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
[2024-11-07 23:56:04,720 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0
[2024-11-07 23:56:04,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,734 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,735 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
[2024-11-07 23:56:04,746 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,747 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0
[2024-11-07 23:56:04,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,759 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,761 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
[2024-11-07 23:56:04,770 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0
[2024-11-07 23:56:04,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,784 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,785 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
[2024-11-07 23:56:04,795 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0
[2024-11-07 23:56:04,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,808 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,810 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
[2024-11-07 23:56:04,820 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0
[2024-11-07 23:56:04,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,834 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,835 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
[2024-11-07 23:56:04,845 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0
[2024-11-07 23:56:04,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,858 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,859 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
[2024-11-07 23:56:04,869 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0
[2024-11-07 23:56:04,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,882 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,884 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
[2024-11-07 23:56:04,893 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0
[2024-11-07 23:56:04,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,912 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,922 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
[2024-11-07 23:56:04,932 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0
[2024-11-07 23:56:04,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,946 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,948 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
[2024-11-07 23:56:04,957 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:04,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,971 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,972 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
[2024-11-07 23:56:04,982 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:04,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:04,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:04,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:04,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:04,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:04,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:04,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:04,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0
[2024-11-07 23:56:04,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:04,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:04,996 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:04,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process
[2024-11-07 23:56:04,998 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
[2024-11-07 23:56:05,007 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0
[2024-11-07 23:56:05,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,021 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,023 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
[2024-11-07 23:56:05,033 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0
[2024-11-07 23:56:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,046 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,048 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
[2024-11-07 23:56:05,057 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0
[2024-11-07 23:56:05,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,071 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,073 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
[2024-11-07 23:56:05,082 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0
[2024-11-07 23:56:05,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,095 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,096 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
[2024-11-07 23:56:05,106 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0
[2024-11-07 23:56:05,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,120 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,121 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
[2024-11-07 23:56:05,131 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0
[2024-11-07 23:56:05,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,144 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,146 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
[2024-11-07 23:56:05,155 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0
[2024-11-07 23:56:05,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,169 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,170 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
[2024-11-07 23:56:05,180 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0
[2024-11-07 23:56:05,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,194 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,195 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
[2024-11-07 23:56:05,205 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0
[2024-11-07 23:56:05,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,218 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,219 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
[2024-11-07 23:56:05,229 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0
[2024-11-07 23:56:05,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,243 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,244 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
[2024-11-07 23:56:05,253 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0
[2024-11-07 23:56:05,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,267 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,268 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
[2024-11-07 23:56:05,278 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0
[2024-11-07 23:56:05,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,292 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,293 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
[2024-11-07 23:56:05,302 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0
[2024-11-07 23:56:05,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,316 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,317 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
[2024-11-07 23:56:05,327 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0
[2024-11-07 23:56:05,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,344 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,345 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
[2024-11-07 23:56:05,355 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0
[2024-11-07 23:56:05,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,368 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,370 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
[2024-11-07 23:56:05,379 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0
[2024-11-07 23:56:05,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,393 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,394 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
[2024-11-07 23:56:05,404 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:05,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:05,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:05,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0
[2024-11-07 23:56:05,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,417 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,419 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
[2024-11-07 23:56:05,429 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:05,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:05,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:05,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0
[2024-11-07 23:56:05,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,445 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,447 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
[2024-11-07 23:56:05,457 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:05,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:05,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:05,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:05,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:05,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:05,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:56:05,490 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver.
[2024-11-07 23:56:05,491 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero.
[2024-11-07 23:56:05,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:05,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:05,493 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:05,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process
[2024-11-07 23:56:05,494 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:56:05,505 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-07 23:56:05,505 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:56:05,505 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select #length merge_sort_merge_~a#1.base)_3, merge_sort_merge_~i~0#1) = 1*v_rep(select #length merge_sort_merge_~a#1.base)_3 - 4*merge_sort_merge_~i~0#1
Supporting invariants []
[2024-11-07 23:56:05,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0
[2024-11-07 23:56:05,541 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed
[2024-11-07 23:56:05,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-07 23:56:05,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-07 23:56:05,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:05,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:05,612 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:05,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:05,773 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:05,790 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates
[2024-11-07 23:56:05,790 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 536 states and 673 transitions. cyclomatic complexity: 157 Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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)
[2024-11-07 23:56:06,032 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 536 states and 673 transitions. cyclomatic complexity: 157. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 688 states and 865 transitions. Complement of second has 22 states.
[2024-11-07 23:56:06,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states
[2024-11-07 23:56:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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)
[2024-11-07 23:56:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions.
[2024-11-07 23:56:06,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 37 letters. Loop has 2 letters.
[2024-11-07 23:56:06,034 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:06,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 39 letters. Loop has 2 letters.
[2024-11-07 23:56:06,034 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:06,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 37 letters. Loop has 4 letters.
[2024-11-07 23:56:06,035 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:06,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 688 states and 865 transitions.
[2024-11-07 23:56:06,039 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 238
[2024-11-07 23:56:06,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 688 states to 621 states and 790 transitions.
[2024-11-07 23:56:06,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 531
[2024-11-07 23:56:06,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 537
[2024-11-07 23:56:06,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 621 states and 790 transitions.
[2024-11-07 23:56:06,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:06,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 621 states and 790 transitions.
[2024-11-07 23:56:06,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states and 790 transitions.
[2024-11-07 23:56:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 533.
[2024-11-07 23:56:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 477 states have (on average 1.2159329140461217) internal successors, (580), 475 states have internal predecessors, (580), 38 states have call successors, (39), 27 states have call predecessors, (39), 18 states have return successors, (59), 30 states have call predecessors, (59), 34 states have call successors, (59)
[2024-11-07 23:56:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 678 transitions.
[2024-11-07 23:56:06,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 533 states and 678 transitions.
[2024-11-07 23:56:06,055 INFO L425 stractBuchiCegarLoop]: Abstraction has 533 states and 678 transitions.
[2024-11-07 23:56:06,055 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============
[2024-11-07 23:56:06,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 533 states and 678 transitions.
[2024-11-07 23:56:06,058 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 178
[2024-11-07 23:56:06,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:06,058 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:06,058 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:06,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:06,059 INFO L745 eck$LassoCheckResult]: Stem: 14876#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14810#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 14811#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 14817#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 14818#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 14925#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 14924#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 14923#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 14922#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 14921#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 14920#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 14919#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 14918#L40-4 havoc main_~i~1#1; 14862#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 14917#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14916#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 14857#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 14915#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14913#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 14909#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 14911#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14914#L24 assume ~n#1 < 2; 14912#merge_sortFINAL assume true; 14908#merge_sortEXIT >#88#return; 14904#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 14905#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14907#L24 assume ~n#1 < 2; 14906#merge_sortFINAL assume true; 14903#merge_sortEXIT >#90#return; 14902#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 14901#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 14900#L12 assume !(merge_~j~0#1 == merge_~n#1); 14899#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 14897#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 14898#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 14947#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 14945#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 14944#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 14941#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 14939#L12
[2024-11-07 23:56:06,059 INFO L747 eck$LassoCheckResult]: Loop: 14939#L12 assume !(merge_~j~0#1 == merge_~n#1); 14935#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 14937#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 14890#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 14932#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 14933#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 14928#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 14929#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 14939#L12
[2024-11-07 23:56:06,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1291809558, now seen corresponding path program 4 times
[2024-11-07 23:56:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:06,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181210279]
[2024-11-07 23:56:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:06,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:06,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:06,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash 291245299, now seen corresponding path program 2 times
[2024-11-07 23:56:06,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:06,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448378720]
[2024-11-07 23:56:06,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:06,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:06,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:06,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:06,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash 593076444, now seen corresponding path program 5 times
[2024-11-07 23:56:06,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:06,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775832663]
[2024-11-07 23:56:06,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:06,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0
[2024-11-07 23:56:06,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 23:56:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:06,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-11-07 23:56:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 23:56:06,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:56:06,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775832663]
[2024-11-07 23:56:06,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775832663] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:56:06,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055495467]
[2024-11-07 23:56:06,419 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-07 23:56:06,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:56:06,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:06,424 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:56:06,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process
[2024-11-07 23:56:06,546 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s)
[2024-11-07 23:56:06,546 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:56:06,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:06,549 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2024-11-07 23:56:06,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 23:56:06,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055495467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:56:06,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 23:56:06,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 22
[2024-11-07 23:56:06,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660961158]
[2024-11-07 23:56:06,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:56:06,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:56:06,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 23:56:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506
[2024-11-07 23:56:06,865 INFO L87 Difference]: Start difference. First operand 533 states and 678 transitions. cyclomatic complexity: 168 Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 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)
[2024-11-07 23:56:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:56:06,954 INFO L93 Difference]: Finished difference Result 529 states and 649 transitions.
[2024-11-07 23:56:06,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 649 transitions.
[2024-11-07 23:56:06,958 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 98
[2024-11-07 23:56:06,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 529 states and 649 transitions.
[2024-11-07 23:56:06,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 445
[2024-11-07 23:56:06,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 505
[2024-11-07 23:56:06,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 649 transitions.
[2024-11-07 23:56:06,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:06,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 529 states and 649 transitions.
[2024-11-07 23:56:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 649 transitions.
[2024-11-07 23:56:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 464.
[2024-11-07 23:56:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 408 states have (on average 1.1813725490196079) internal successors, (482), 406 states have internal predecessors, (482), 38 states have call successors, (39), 27 states have call predecessors, (39), 18 states have return successors, (59), 30 states have call predecessors, (59), 34 states have call successors, (59)
[2024-11-07 23:56:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 580 transitions.
[2024-11-07 23:56:06,971 INFO L240 hiAutomatonCegarLoop]: Abstraction has 464 states and 580 transitions.
[2024-11-07 23:56:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 23:56:06,972 INFO L425 stractBuchiCegarLoop]: Abstraction has 464 states and 580 transitions.
[2024-11-07 23:56:06,972 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============
[2024-11-07 23:56:06,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 464 states and 580 transitions.
[2024-11-07 23:56:06,974 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 98
[2024-11-07 23:56:06,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:06,974 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:06,975 INFO L148 hiAutomatonCegarLoop]: 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, 1]
[2024-11-07 23:56:06,975 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:56:06,975 INFO L745 eck$LassoCheckResult]: Stem: 16095#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 16047#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16048#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 16050#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 16051#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 16052#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 16053#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 16116#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 16112#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 16113#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 16114#L40-4 havoc main_~i~1#1; 16028#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 16029#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16265#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 16262#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 16263#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16266#L24 assume ~n#1 < 2; 16264#merge_sortFINAL assume true; 16261#merge_sortEXIT >#88#return; 16064#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 16181#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16417#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 16063#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 16065#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16390#L24 assume ~n#1 < 2; 16387#merge_sortFINAL assume true; 16389#merge_sortEXIT >#88#return; 16058#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 16083#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16089#L24 assume ~n#1 < 2; 16090#merge_sortFINAL assume true; 16057#merge_sortEXIT >#90#return; 16059#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 16441#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16437#L12 assume !(merge_~j~0#1 == merge_~n#1); 16438#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 16432#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 16433#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 16428#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 16429#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 16424#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 16425#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16420#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 16418#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 16384#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 16282#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 16280#L11-4 merge_~i~0#1 := 0; 16277#L17-3
[2024-11-07 23:56:06,975 INFO L747 eck$LassoCheckResult]: Loop: 16277#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 16278#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 16277#L17-3
[2024-11-07 23:56:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 107885914, now seen corresponding path program 2 times
[2024-11-07 23:56:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160993063]
[2024-11-07 23:56:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:07,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:07,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:07,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:07,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times
[2024-11-07 23:56:07,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:07,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600561270]
[2024-11-07 23:56:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:07,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:07,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:07,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:07,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 599149852, now seen corresponding path program 2 times
[2024-11-07 23:56:07,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:07,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154847788]
[2024-11-07 23:56:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:07,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:07,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:10,540 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:56:10,540 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:56:10,540 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:56:10,540 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:56:10,540 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:56:10,540 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:10,540 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:56:10,540 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:56:10,540 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration19_Lasso
[2024-11-07 23:56:10,540 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:56:10,540 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:56:10,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:10,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:11,673 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:56:11,673 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:56:11,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,676 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,678 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
[2024-11-07 23:56:11,689 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:11,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,703 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,704 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
[2024-11-07 23:56:11,713 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0
[2024-11-07 23:56:11,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,727 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,728 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
[2024-11-07 23:56:11,738 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0
[2024-11-07 23:56:11,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,751 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,753 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
[2024-11-07 23:56:11,762 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0
[2024-11-07 23:56:11,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,776 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,778 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
[2024-11-07 23:56:11,787 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0
[2024-11-07 23:56:11,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,801 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,803 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
[2024-11-07 23:56:11,813 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0
[2024-11-07 23:56:11,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,826 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,828 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
[2024-11-07 23:56:11,837 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0
[2024-11-07 23:56:11,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,851 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,852 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
[2024-11-07 23:56:11,861 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0
[2024-11-07 23:56:11,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,875 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,876 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
[2024-11-07 23:56:11,886 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0
[2024-11-07 23:56:11,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,900 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,902 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
[2024-11-07 23:56:11,911 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0
[2024-11-07 23:56:11,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,925 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,926 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
[2024-11-07 23:56:11,937 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0
[2024-11-07 23:56:11,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,950 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,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
[2024-11-07 23:56:11,961 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0
[2024-11-07 23:56:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,975 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:11,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process
[2024-11-07 23:56:11,976 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
[2024-11-07 23:56:11,986 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:11,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:11,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:11,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:11,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:11,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:11,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:11,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:11,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0
[2024-11-07 23:56:11,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:11,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:11,999 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:12,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process
[2024-11-07 23:56:12,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
[2024-11-07 23:56:12,010 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:12,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:12,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:12,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:12,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:12,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:12,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:12,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:12,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0
[2024-11-07 23:56:12,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:12,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:12,025 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:12,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process
[2024-11-07 23:56:12,026 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
[2024-11-07 23:56:12,036 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:12,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:12,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:12,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:12,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:12,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:12,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:12,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:12,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0
[2024-11-07 23:56:12,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:12,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:12,050 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:12,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process
[2024-11-07 23:56:12,052 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
[2024-11-07 23:56:12,061 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:12,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:12,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:12,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:12,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:12,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:12,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:12,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:12,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0
[2024-11-07 23:56:12,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:12,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:12,075 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:12,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process
[2024-11-07 23:56:12,077 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
[2024-11-07 23:56:12,087 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:12,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:12,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:12,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:12,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:12,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:12,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:12,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:12,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0
[2024-11-07 23:56:12,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:12,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:12,101 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:12,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process
[2024-11-07 23:56:12,102 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
[2024-11-07 23:56:12,112 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:12,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:12,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:12,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:12,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:12,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:12,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:12,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:12,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0
[2024-11-07 23:56:12,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:12,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:12,126 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:12,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process
[2024-11-07 23:56:12,127 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
[2024-11-07 23:56:12,137 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:12,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:12,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:12,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:12,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:12,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:12,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:12,138 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:12,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0
[2024-11-07 23:56:12,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:12,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:12,151 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:12,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process
[2024-11-07 23:56:12,152 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
[2024-11-07 23:56:12,162 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:12,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:12,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:12,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:12,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:12,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:12,189 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:56:12,203 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver.
[2024-11-07 23:56:12,204 INFO L444 ModelExtractionUtils]: 34 out of 43 variables were initially zero. Simplification set additionally 6 variables to zero.
[2024-11-07 23:56:12,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:12,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:12,206 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:12,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process
[2024-11-07 23:56:12,207 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:56:12,217 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-07 23:56:12,218 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:56:12,218 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~i~0#1) = 1*merge_sort_merge_~n#1 - 1*merge_sort_merge_~i~0#1
Supporting invariants []
[2024-11-07 23:56:12,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0
[2024-11-07 23:56:12,246 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed
[2024-11-07 23:56:12,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:12,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:12,317 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:12,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:12,421 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:12,433 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates
[2024-11-07 23:56:12,434 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 464 states and 580 transitions. cyclomatic complexity: 131 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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)
[2024-11-07 23:56:12,469 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 464 states and 580 transitions. cyclomatic complexity: 131. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 525 states and 657 transitions. Complement of second has 7 states.
[2024-11-07 23:56:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-07 23:56:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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)
[2024-11-07 23:56:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions.
[2024-11-07 23:56:12,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 47 letters. Loop has 2 letters.
[2024-11-07 23:56:12,471 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:12,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 49 letters. Loop has 2 letters.
[2024-11-07 23:56:12,471 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:12,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 47 letters. Loop has 4 letters.
[2024-11-07 23:56:12,471 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:12,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 525 states and 657 transitions.
[2024-11-07 23:56:12,475 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 98
[2024-11-07 23:56:12,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 525 states to 521 states and 649 transitions.
[2024-11-07 23:56:12,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 488
[2024-11-07 23:56:12,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491
[2024-11-07 23:56:12,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 521 states and 649 transitions.
[2024-11-07 23:56:12,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:12,480 INFO L218 hiAutomatonCegarLoop]: Abstraction has 521 states and 649 transitions.
[2024-11-07 23:56:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states and 649 transitions.
[2024-11-07 23:56:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 488.
[2024-11-07 23:56:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 432 states have (on average 1.1851851851851851) internal successors, (512), 431 states have internal predecessors, (512), 38 states have call successors, (39), 27 states have call predecessors, (39), 18 states have return successors, (59), 29 states have call predecessors, (59), 34 states have call successors, (59)
[2024-11-07 23:56:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 610 transitions.
[2024-11-07 23:56:12,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 488 states and 610 transitions.
[2024-11-07 23:56:12,490 INFO L425 stractBuchiCegarLoop]: Abstraction has 488 states and 610 transitions.
[2024-11-07 23:56:12,490 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============
[2024-11-07 23:56:12,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 488 states and 610 transitions.
[2024-11-07 23:56:12,492 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 98
[2024-11-07 23:56:12,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:12,493 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:12,494 INFO L148 hiAutomatonCegarLoop]: 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]
[2024-11-07 23:56:12,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:12,495 INFO L745 eck$LassoCheckResult]: Stem: 17290#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 17236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 17237#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 17242#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 17243#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 17244#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 17245#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 17305#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 17303#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 17304#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 17306#L40-4 havoc main_~i~1#1; 17221#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 17222#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17397#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 17393#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 17394#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17398#L24 assume ~n#1 < 2; 17396#merge_sortFINAL assume true; 17392#merge_sortEXIT >#88#return; 17239#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 17387#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17388#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 17368#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 17372#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17488#L24 assume ~n#1 < 2; 17487#merge_sortFINAL assume true; 17367#merge_sortEXIT >#88#return; 17360#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 17365#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17366#L24 assume ~n#1 < 2; 17359#merge_sortFINAL assume true; 17361#merge_sortEXIT >#90#return; 17352#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 17353#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 17348#L12 assume !(merge_~j~0#1 == merge_~n#1); 17349#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 17339#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 17340#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 17331#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 17332#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 17483#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17480#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 17453#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 17451#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 17452#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17552#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 17446#L11-4 merge_~i~0#1 := 0; 17447#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 17541#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 17238#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 17241#merge_sortFINAL assume true; 17255#merge_sortEXIT >#90#return; 17412#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 17527#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 17526#L12 assume !(merge_~j~0#1 == merge_~n#1); 17525#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 17522#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 17519#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 17517#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 17515#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 17513#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17511#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 17510#L12
[2024-11-07 23:56:12,495 INFO L747 eck$LassoCheckResult]: Loop: 17510#L12 assume !(merge_~j~0#1 == merge_~n#1); 17524#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 17520#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 17521#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 17509#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 17505#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 17503#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17504#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 17510#L12
[2024-11-07 23:56:12,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1365976563, now seen corresponding path program 1 times
[2024-11-07 23:56:12,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:12,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149716254]
[2024-11-07 23:56:12,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-07 23:56:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 23:56:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-07 23:56:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:12,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-07 23:56:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2024-11-07 23:56:12,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:56:12,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149716254]
[2024-11-07 23:56:12,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149716254] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:56:12,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663708812]
[2024-11-07 23:56:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:12,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:56:12,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:12,627 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:56:12,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process
[2024-11-07 23:56:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:12,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:12,761 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:12,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0
[2024-11-07 23:56:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2024-11-07 23:56:12,960 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:56:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-07 23:56:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663708812] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:56:13,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:56:13,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 27
[2024-11-07 23:56:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440467522]
[2024-11-07 23:56:13,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:56:13,284 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:56:13,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times
[2024-11-07 23:56:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818265938]
[2024-11-07 23:56:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:13,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:13,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:56:13,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-11-07 23:56:13,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702
[2024-11-07 23:56:13,515 INFO L87 Difference]: Start difference. First operand 488 states and 610 transitions. cyclomatic complexity: 139 Second operand has 27 states, 25 states have (on average 3.8) internal successors, (95), 22 states have internal predecessors, (95), 9 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11)
[2024-11-07 23:56:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:56:14,418 INFO L93 Difference]: Finished difference Result 681 states and 830 transitions.
[2024-11-07 23:56:14,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 681 states and 830 transitions.
[2024-11-07 23:56:14,422 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 144
[2024-11-07 23:56:14,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 681 states to 681 states and 830 transitions.
[2024-11-07 23:56:14,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 644
[2024-11-07 23:56:14,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 644
[2024-11-07 23:56:14,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 681 states and 830 transitions.
[2024-11-07 23:56:14,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:14,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 681 states and 830 transitions.
[2024-11-07 23:56:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states and 830 transitions.
[2024-11-07 23:56:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 501.
[2024-11-07 23:56:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 445 states have (on average 1.1730337078651685) internal successors, (522), 446 states have internal predecessors, (522), 37 states have call successors, (38), 26 states have call predecessors, (38), 19 states have return successors, (58), 28 states have call predecessors, (58), 33 states have call successors, (58)
[2024-11-07 23:56:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 618 transitions.
[2024-11-07 23:56:14,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 501 states and 618 transitions.
[2024-11-07 23:56:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states.
[2024-11-07 23:56:14,437 INFO L425 stractBuchiCegarLoop]: Abstraction has 501 states and 618 transitions.
[2024-11-07 23:56:14,437 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============
[2024-11-07 23:56:14,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 501 states and 618 transitions.
[2024-11-07 23:56:14,439 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 98
[2024-11-07 23:56:14,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:14,439 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:14,440 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1]
[2024-11-07 23:56:14,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:14,440 INFO L745 eck$LassoCheckResult]: Stem: 18952#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 18905#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 18906#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 18910#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 18911#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 18912#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 18913#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 18965#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 18963#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 18964#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 18951#L40-4 havoc main_~i~1#1; 18896#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 18897#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19135#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 19128#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 19129#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19139#L24 assume ~n#1 < 2; 19134#merge_sortFINAL assume true; 19127#merge_sortEXIT >#88#return; 18899#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 19068#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19277#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 18923#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 18924#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19325#L24 assume ~n#1 < 2; 19324#merge_sortFINAL assume true; 19323#merge_sortEXIT >#88#return; 18921#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 18928#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 18929#L24 assume ~n#1 < 2; 18922#merge_sortFINAL assume true; 18920#merge_sortEXIT >#90#return; 18918#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 18919#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 19391#L12 assume !(merge_~j~0#1 == merge_~n#1); 19390#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 19388#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 19387#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 19386#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 19385#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 18947#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 18948#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 18916#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 18917#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 18953#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19043#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 18971#L11-4 merge_~i~0#1 := 0; 18972#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 18976#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 18945#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 18939#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 18940#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 18901#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 18902#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 19198#merge_sortFINAL assume true; 19199#merge_sortEXIT >#90#return; 19064#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 19063#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 19062#L12 assume !(merge_~j~0#1 == merge_~n#1); 19061#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 19059#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 19058#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 19057#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 19056#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 19055#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19054#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 19050#L12
[2024-11-07 23:56:14,441 INFO L747 eck$LassoCheckResult]: Loop: 19050#L12 assume !(merge_~j~0#1 == merge_~n#1); 19052#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 19081#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 19082#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 19053#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 19049#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 19047#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19048#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 19050#L12
[2024-11-07 23:56:14,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash 875722351, now seen corresponding path program 1 times
[2024-11-07 23:56:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242252016]
[2024-11-07 23:56:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:14,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:14,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:14,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:14,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times
[2024-11-07 23:56:14,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:14,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170488248]
[2024-11-07 23:56:14,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:14,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:14,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:14,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash 817267747, now seen corresponding path program 2 times
[2024-11-07 23:56:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:14,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298440127]
[2024-11-07 23:56:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:14,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:14,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:14,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:19,006 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:56:19,006 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:56:19,006 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:56:19,006 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:56:19,006 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:56:19,006 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:19,006 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:56:19,006 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:56:19,006 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration21_Lasso
[2024-11-07 23:56:19,006 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:56:19,006 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:56:19,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:19,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:20,343 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:56:20,343 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:56:20,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,346 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,348 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
[2024-11-07 23:56:20,361 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:20,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:20,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:20,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:20,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,379 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,381 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
[2024-11-07 23:56:20,391 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:20,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:20,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:20,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0
[2024-11-07 23:56:20,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,405 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,407 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
[2024-11-07 23:56:20,416 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:20,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:20,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:20,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0
[2024-11-07 23:56:20,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,430 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,431 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
[2024-11-07 23:56:20,441 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:20,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:20,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:20,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0
[2024-11-07 23:56:20,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,454 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,456 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
[2024-11-07 23:56:20,465 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:20,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:20,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:20,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0
[2024-11-07 23:56:20,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,479 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,480 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
[2024-11-07 23:56:20,490 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:20,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:20,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:20,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0
[2024-11-07 23:56:20,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,504 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,506 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
[2024-11-07 23:56:20,516 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:20,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:20,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:20,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0
[2024-11-07 23:56:20,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,530 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,531 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
[2024-11-07 23:56:20,541 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:20,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:20,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:20,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0
[2024-11-07 23:56:20,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,555 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,556 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
[2024-11-07 23:56:20,566 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:20,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:20,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:20,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0
[2024-11-07 23:56:20,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,579 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,580 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
[2024-11-07 23:56:20,590 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:20,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:20,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0
[2024-11-07 23:56:20,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,607 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,608 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
[2024-11-07 23:56:20,618 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:20,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:20,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0
[2024-11-07 23:56:20,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,633 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,635 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
[2024-11-07 23:56:20,644 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:20,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:20,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:20,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:20,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0
[2024-11-07 23:56:20,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:20,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:20,664 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:20,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process
[2024-11-07 23:56:20,666 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
[2024-11-07 23:56:20,676 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:20,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:20,676 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts
[2024-11-07 23:56:20,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:20,718 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications.
[2024-11-07 23:56:20,718 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added.
[2024-11-07 23:56:20,923 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:56:21,689 INFO L443 ModelExtractionUtils]: Simplification made 79 calls to the SMT solver.
[2024-11-07 23:56:21,690 INFO L444 ModelExtractionUtils]: 31 out of 100 variables were initially zero. Simplification set additionally 65 variables to zero.
[2024-11-07 23:56:21,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:21,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:21,692 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:21,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process
[2024-11-07 23:56:21,693 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:56:21,707 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8.
[2024-11-07 23:56:21,707 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:56:21,707 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~j~0#1, merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_merge_~a#1.base)_5) = -4*merge_sort_merge_~j~0#1 + 4*merge_sort_merge_~i~0#1 + 1*v_rep(select #length merge_sort_merge_~a#1.base)_5
Supporting invariants []
[2024-11-07 23:56:21,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0
[2024-11-07 23:56:21,771 INFO L156 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed
[2024-11-07 23:56:21,772 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-07 23:56:21,772 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-07 23:56:21,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:21,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:21,876 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:22,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:22,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:22,181 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:22,238 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates
[2024-11-07 23:56:22,238 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 501 states and 618 transitions. cyclomatic complexity: 134 Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:22,296 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 501 states and 618 transitions. cyclomatic complexity: 134. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 567 states and 687 transitions. Complement of second has 9 states.
[2024-11-07 23:56:22,299 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
[2024-11-07 23:56:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions.
[2024-11-07 23:56:22,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 66 letters. Loop has 8 letters.
[2024-11-07 23:56:22,300 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:22,300 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-07 23:56:22,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:22,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:22,396 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:22,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:22,656 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:22,698 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates
[2024-11-07 23:56:22,698 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 501 states and 618 transitions. cyclomatic complexity: 134 Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:22,757 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 501 states and 618 transitions. cyclomatic complexity: 134. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 570 states and 690 transitions. Complement of second has 11 states.
[2024-11-07 23:56:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states
[2024-11-07 23:56:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions.
[2024-11-07 23:56:22,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 66 letters. Loop has 8 letters.
[2024-11-07 23:56:22,759 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:22,759 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-07 23:56:22,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:22,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:22,866 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:23,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:23,094 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:23,144 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates
[2024-11-07 23:56:23,144 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 501 states and 618 transitions. cyclomatic complexity: 134 Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:23,211 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 501 states and 618 transitions. cyclomatic complexity: 134. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 742 states and 899 transitions. Complement of second has 17 states.
[2024-11-07 23:56:23,212 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
[2024-11-07 23:56:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions.
[2024-11-07 23:56:23,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 66 letters. Loop has 8 letters.
[2024-11-07 23:56:23,213 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:23,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 74 letters. Loop has 8 letters.
[2024-11-07 23:56:23,214 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:23,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 66 letters. Loop has 16 letters.
[2024-11-07 23:56:23,216 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:23,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 742 states and 899 transitions.
[2024-11-07 23:56:23,220 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 166
[2024-11-07 23:56:23,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 742 states to 705 states and 852 transitions.
[2024-11-07 23:56:23,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 457
[2024-11-07 23:56:23,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 589
[2024-11-07 23:56:23,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 852 transitions.
[2024-11-07 23:56:23,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:23,225 INFO L218 hiAutomatonCegarLoop]: Abstraction has 705 states and 852 transitions.
[2024-11-07 23:56:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 852 transitions.
[2024-11-07 23:56:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 631.
[2024-11-07 23:56:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 575 states have (on average 1.1860869565217391) internal successors, (682), 576 states have internal predecessors, (682), 37 states have call successors, (38), 26 states have call predecessors, (38), 19 states have return successors, (58), 28 states have call predecessors, (58), 33 states have call successors, (58)
[2024-11-07 23:56:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 778 transitions.
[2024-11-07 23:56:23,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 631 states and 778 transitions.
[2024-11-07 23:56:23,235 INFO L425 stractBuchiCegarLoop]: Abstraction has 631 states and 778 transitions.
[2024-11-07 23:56:23,235 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============
[2024-11-07 23:56:23,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 631 states and 778 transitions.
[2024-11-07 23:56:23,237 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 166
[2024-11-07 23:56:23,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:23,238 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:23,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:23,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:23,238 INFO L745 eck$LassoCheckResult]: Stem: 22163#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 22106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 22107#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 22111#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 22112#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 22113#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 22114#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 22177#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 22175#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 22176#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 22159#L40-4 havoc main_~i~1#1; 22086#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 22087#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 22314#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 22311#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 22312#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 22315#L24 assume ~n#1 < 2; 22313#merge_sortFINAL assume true; 22310#merge_sortEXIT >#88#return; 22146#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 22309#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 22307#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 22303#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 22304#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 22308#L24 assume ~n#1 < 2; 22306#merge_sortFINAL assume true; 22302#merge_sortEXIT >#88#return; 22298#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 22300#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 22305#L24 assume ~n#1 < 2; 22301#merge_sortFINAL assume true; 22297#merge_sortEXIT >#90#return; 22299#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 22294#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 22295#L12 assume !(merge_~j~0#1 == merge_~n#1); 22289#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 22290#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 22284#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 22286#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 22280#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 22281#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22275#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 22277#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 22188#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 22189#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22371#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 22370#L11-4 merge_~i~0#1 := 0; 22197#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 22198#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 22152#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 22145#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 22147#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 22367#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 22365#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 22363#merge_sortFINAL assume true; 22360#merge_sortEXIT >#90#return; 22356#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 22354#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 22350#L12 assume !(merge_~j~0#1 == merge_~n#1); 22347#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 22344#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 22343#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 22342#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 22340#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 22338#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22336#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 22333#L12
[2024-11-07 23:56:23,239 INFO L747 eck$LassoCheckResult]: Loop: 22333#L12 assume !(merge_~j~0#1 == merge_~n#1); 22330#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 22331#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 22328#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 22329#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 22341#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 22339#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22337#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 22333#L12
[2024-11-07 23:56:23,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash 932980653, now seen corresponding path program 1 times
[2024-11-07 23:56:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:23,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727847644]
[2024-11-07 23:56:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:23,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:23,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:23,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash 291245299, now seen corresponding path program 3 times
[2024-11-07 23:56:23,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:23,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106433452]
[2024-11-07 23:56:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:23,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:23,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:23,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:23,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:23,338 INFO L85 PathProgramCache]: Analyzing trace with hash -136591201, now seen corresponding path program 2 times
[2024-11-07 23:56:23,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:23,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228968768]
[2024-11-07 23:56:23,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:23,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-07 23:56:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 23:56:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:23,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-07 23:56:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-07 23:56:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 37 proven. 22 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-07 23:56:23,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:56:23,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228968768]
[2024-11-07 23:56:23,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228968768] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:56:23,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928458674]
[2024-11-07 23:56:23,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 23:56:23,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:56:23,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:23,901 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:56:23,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process
[2024-11-07 23:56:24,073 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-07 23:56:24,073 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:56:24,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 32 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:24,078 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-11-07 23:56:24,456 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:56:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2024-11-07 23:56:25,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928458674] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:56:25,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:56:25,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 17] total 40
[2024-11-07 23:56:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180961968]
[2024-11-07 23:56:25,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:56:25,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:56:25,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-11-07 23:56:25,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1438, Unknown=0, NotChecked=0, Total=1560
[2024-11-07 23:56:25,409 INFO L87 Difference]: Start difference. First operand 631 states and 778 transitions. cyclomatic complexity: 164 Second operand has 40 states, 36 states have (on average 3.25) internal successors, (117), 30 states have internal predecessors, (117), 13 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12)
[2024-11-07 23:56:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:56:26,818 INFO L93 Difference]: Finished difference Result 913 states and 1127 transitions.
[2024-11-07 23:56:26,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 1127 transitions.
[2024-11-07 23:56:26,823 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 261
[2024-11-07 23:56:26,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 865 states and 1070 transitions.
[2024-11-07 23:56:26,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 741
[2024-11-07 23:56:26,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 741
[2024-11-07 23:56:26,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 865 states and 1070 transitions.
[2024-11-07 23:56:26,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:26,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 865 states and 1070 transitions.
[2024-11-07 23:56:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states and 1070 transitions.
[2024-11-07 23:56:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 649.
[2024-11-07 23:56:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 593 states have (on average 1.1838111298482294) internal successors, (702), 593 states have internal predecessors, (702), 37 states have call successors, (38), 26 states have call predecessors, (38), 19 states have return successors, (58), 29 states have call predecessors, (58), 33 states have call successors, (58)
[2024-11-07 23:56:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 798 transitions.
[2024-11-07 23:56:26,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 649 states and 798 transitions.
[2024-11-07 23:56:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2024-11-07 23:56:26,842 INFO L425 stractBuchiCegarLoop]: Abstraction has 649 states and 798 transitions.
[2024-11-07 23:56:26,842 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============
[2024-11-07 23:56:26,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 649 states and 798 transitions.
[2024-11-07 23:56:26,845 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 146
[2024-11-07 23:56:26,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:26,845 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:26,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 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, 1, 1]
[2024-11-07 23:56:26,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:26,846 INFO L745 eck$LassoCheckResult]: Stem: 24305#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 24255#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 24256#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 24260#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 24261#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 24262#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 24263#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 24320#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 24318#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 24319#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 24321#L40-4 havoc main_~i~1#1; 24232#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 24233#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 24400#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 24395#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 24397#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 24401#L24 assume ~n#1 < 2; 24398#merge_sortFINAL assume true; 24394#merge_sortEXIT >#88#return; 24258#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 24392#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 24391#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 24372#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 24376#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 24497#L24 assume ~n#1 < 2; 24495#merge_sortFINAL assume true; 24371#merge_sortEXIT >#88#return; 24359#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 24370#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 24368#L24 assume ~n#1 < 2; 24369#merge_sortFINAL assume true; 24358#merge_sortEXIT >#90#return; 24360#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 24354#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 24355#L12 assume !(merge_~j~0#1 == merge_~n#1); 24349#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 24350#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 24344#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 24346#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 24340#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 24341#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 24335#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 24337#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 24330#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 24331#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 24713#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 24325#L11-4 merge_~i~0#1 := 0; 24326#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 24562#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 24563#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 24295#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 24296#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 24704#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 24257#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 24259#merge_sortFINAL assume true; 24695#merge_sortEXIT >#90#return; 24273#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 24793#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 24791#L12 assume !(merge_~j~0#1 == merge_~n#1); 24790#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 24789#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 24788#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 24787#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 24786#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 24785#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 24783#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 24784#L12 assume !(merge_~j~0#1 == merge_~n#1); 24248#L13
[2024-11-07 23:56:26,846 INFO L747 eck$LassoCheckResult]: Loop: 24248#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 24252#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 24800#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 24799#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 24780#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 24781#L12 assume !(merge_~j~0#1 == merge_~n#1); 24248#L13
[2024-11-07 23:56:26,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:26,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1142370809, now seen corresponding path program 3 times
[2024-11-07 23:56:26,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:26,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613504747]
[2024-11-07 23:56:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:26,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:26,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:26,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:26,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1578483347, now seen corresponding path program 4 times
[2024-11-07 23:56:26,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:26,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763645747]
[2024-11-07 23:56:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:26,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:26,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:26,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash 219246617, now seen corresponding path program 1 times
[2024-11-07 23:56:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546757788]
[2024-11-07 23:56:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:26,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:26,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:27,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:35,103 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:56:35,103 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:56:35,103 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:56:35,103 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:56:35,103 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:56:35,103 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:35,103 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:56:35,103 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:56:35,104 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration23_Lasso
[2024-11-07 23:56:35,104 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:56:35,104 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:56:35,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:35,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:36,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:37,156 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:56:37,156 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:56:37,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,161 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,165 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
[2024-11-07 23:56:37,178 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0
[2024-11-07 23:56:37,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,195 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,197 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
[2024-11-07 23:56:37,206 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0
[2024-11-07 23:56:37,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,220 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,221 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
[2024-11-07 23:56:37,230 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0
[2024-11-07 23:56:37,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,247 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,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
[2024-11-07 23:56:37,258 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0
[2024-11-07 23:56:37,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,272 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,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
[2024-11-07 23:56:37,282 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0
[2024-11-07 23:56:37,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,296 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,297 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
[2024-11-07 23:56:37,308 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0
[2024-11-07 23:56:37,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,322 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,323 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
[2024-11-07 23:56:37,333 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0
[2024-11-07 23:56:37,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,347 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,348 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
[2024-11-07 23:56:37,358 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0
[2024-11-07 23:56:37,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,372 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,374 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
[2024-11-07 23:56:37,384 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0
[2024-11-07 23:56:37,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,397 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,398 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
[2024-11-07 23:56:37,407 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0
[2024-11-07 23:56:37,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,421 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,423 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
[2024-11-07 23:56:37,434 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:37,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,447 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,448 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
[2024-11-07 23:56:37,458 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0
[2024-11-07 23:56:37,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,471 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,472 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
[2024-11-07 23:56:37,483 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:37,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:37,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0
[2024-11-07 23:56:37,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,499 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,501 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
[2024-11-07 23:56:37,510 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:37,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:37,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0
[2024-11-07 23:56:37,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,526 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,527 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
[2024-11-07 23:56:37,537 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:37,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:37,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0
[2024-11-07 23:56:37,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,551 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,553 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
[2024-11-07 23:56:37,562 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:37,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:37,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:37,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0
[2024-11-07 23:56:37,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,576 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,577 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
[2024-11-07 23:56:37,586 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:37,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:37,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0
[2024-11-07 23:56:37,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,604 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,605 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
[2024-11-07 23:56:37,614 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:37,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:37,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0
[2024-11-07 23:56:37,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,629 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,631 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
[2024-11-07 23:56:37,640 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:37,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:37,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:37,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:37,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0
[2024-11-07 23:56:37,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:37,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:37,658 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:37,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process
[2024-11-07 23:56:37,659 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
[2024-11-07 23:56:37,670 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:37,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:37,670 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts
[2024-11-07 23:56:37,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:37,692 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications.
[2024-11-07 23:56:37,692 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added.
[2024-11-07 23:56:37,793 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:56:38,194 INFO L443 ModelExtractionUtils]: Simplification made 51 calls to the SMT solver.
[2024-11-07 23:56:38,194 INFO L444 ModelExtractionUtils]: 5 out of 76 variables were initially zero. Simplification set additionally 68 variables to zero.
[2024-11-07 23:56:38,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:38,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:38,196 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:38,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process
[2024-11-07 23:56:38,197 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:56:38,209 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4.
[2024-11-07 23:56:38,209 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:56:38,209 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~k~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~k~0#1 + 1*merge_sort_merge_~n#1
Supporting invariants []
[2024-11-07 23:56:38,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0
[2024-11-07 23:56:38,353 INFO L156 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed
[2024-11-07 23:56:38,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:38,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:38,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:38,437 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:38,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:38,641 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:38,669 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates
[2024-11-07 23:56:38,669 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 649 states and 798 transitions. cyclomatic complexity: 167 Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:38,723 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 649 states and 798 transitions. cyclomatic complexity: 167. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 730 states and 894 transitions. Complement of second has 9 states.
[2024-11-07 23:56:38,724 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
[2024-11-07 23:56:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions.
[2024-11-07 23:56:38,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 67 letters. Loop has 6 letters.
[2024-11-07 23:56:38,725 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:38,725 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-07 23:56:38,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:38,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:38,830 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:39,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:39,075 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:39,093 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates
[2024-11-07 23:56:39,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 649 states and 798 transitions. cyclomatic complexity: 167 Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:39,146 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 649 states and 798 transitions. cyclomatic complexity: 167. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 745 states and 906 transitions. Complement of second has 11 states.
[2024-11-07 23:56:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states
[2024-11-07 23:56:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions.
[2024-11-07 23:56:39,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 67 letters. Loop has 6 letters.
[2024-11-07 23:56:39,147 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:39,147 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-07 23:56:39,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:39,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:39,239 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:39,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:39,514 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:39,535 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates
[2024-11-07 23:56:39,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 649 states and 798 transitions. cyclomatic complexity: 167 Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:39,577 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 649 states and 798 transitions. cyclomatic complexity: 167. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1038 states and 1260 transitions. Complement of second has 17 states.
[2024-11-07 23:56:39,578 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
[2024-11-07 23:56:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions.
[2024-11-07 23:56:39,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 67 letters. Loop has 6 letters.
[2024-11-07 23:56:39,579 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:39,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 73 letters. Loop has 6 letters.
[2024-11-07 23:56:39,579 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:39,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 67 letters. Loop has 12 letters.
[2024-11-07 23:56:39,579 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:39,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1038 states and 1260 transitions.
[2024-11-07 23:56:39,588 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18
[2024-11-07 23:56:39,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1038 states to 802 states and 989 transitions.
[2024-11-07 23:56:39,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352
[2024-11-07 23:56:39,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530
[2024-11-07 23:56:39,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 802 states and 989 transitions.
[2024-11-07 23:56:39,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:39,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 802 states and 989 transitions.
[2024-11-07 23:56:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states and 989 transitions.
[2024-11-07 23:56:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 664.
[2024-11-07 23:56:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 608 states have (on average 1.2335526315789473) internal successors, (750), 608 states have internal predecessors, (750), 37 states have call successors, (38), 26 states have call predecessors, (38), 19 states have return successors, (58), 29 states have call predecessors, (58), 33 states have call successors, (58)
[2024-11-07 23:56:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 846 transitions.
[2024-11-07 23:56:39,606 INFO L240 hiAutomatonCegarLoop]: Abstraction has 664 states and 846 transitions.
[2024-11-07 23:56:39,606 INFO L425 stractBuchiCegarLoop]: Abstraction has 664 states and 846 transitions.
[2024-11-07 23:56:39,606 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============
[2024-11-07 23:56:39,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 664 states and 846 transitions.
[2024-11-07 23:56:39,608 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18
[2024-11-07 23:56:39,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:39,608 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:39,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:39,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:56:39,609 INFO L745 eck$LassoCheckResult]: Stem: 28290#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 28229#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 28230#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 28232#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 28233#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28234#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 28235#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28307#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 28305#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28306#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 28308#L40-4 havoc main_~i~1#1; 28211#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 28212#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28412#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 28407#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28409#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28413#L24 assume ~n#1 < 2; 28410#merge_sortFINAL assume true; 28406#merge_sortEXIT >#88#return; 28280#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 28494#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28492#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 28379#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28384#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28398#L24 assume ~n#1 < 2; 28399#merge_sortFINAL assume true; 28378#merge_sortEXIT >#88#return; 28368#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 28377#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28375#L24 assume ~n#1 < 2; 28376#merge_sortFINAL assume true; 28367#merge_sortEXIT >#90#return; 28369#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 28631#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 28629#L12 assume !(merge_~j~0#1 == merge_~n#1); 28630#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 28354#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 28355#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 28345#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 28341#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 28328#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28329#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 28320#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 28318#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 28319#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28314#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 28315#L11-4 merge_~i~0#1 := 0; 28310#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 28311#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 28279#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 28281#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 28539#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 28540#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 28615#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 28613#merge_sortFINAL assume true; 28611#merge_sortEXIT >#90#return; 28609#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 28608#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 28606#L12 assume !(merge_~j~0#1 == merge_~n#1); 28607#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 28636#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 28601#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 28590#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 28587#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 28584#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28567#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 28568#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 28550#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 28548#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28547#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 28546#L11-4 merge_~i~0#1 := 0; 28271#L17-3
[2024-11-07 23:56:39,609 INFO L747 eck$LassoCheckResult]: Loop: 28271#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 28268#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 28271#L17-3
[2024-11-07 23:56:39,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1252013118, now seen corresponding path program 3 times
[2024-11-07 23:56:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:39,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411570476]
[2024-11-07 23:56:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:39,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:39,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-07 23:56:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:39,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-07 23:56:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:39,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-07 23:56:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-07 23:56:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2024-11-07 23:56:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:56:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411570476]
[2024-11-07 23:56:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411570476] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:56:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814137253]
[2024-11-07 23:56:39,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 23:56:39,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:56:39,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:39,952 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:56:39,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process
[2024-11-07 23:56:40,141 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2024-11-07 23:56:40,141 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:56:40,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:40,145 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 31 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-07 23:56:40,312 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:56:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 31 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-07 23:56:40,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814137253] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:56:40,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:56:40,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24
[2024-11-07 23:56:40,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229196822]
[2024-11-07 23:56:40,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:56:40,475 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:56:40,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:40,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 5 times
[2024-11-07 23:56:40,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:40,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612512184]
[2024-11-07 23:56:40,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:40,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:40,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:40,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:40,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:56:40,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-11-07 23:56:40,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552
[2024-11-07 23:56:40,540 INFO L87 Difference]: Start difference. First operand 664 states and 846 transitions. cyclomatic complexity: 204 Second operand has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 21 states have internal predecessors, (106), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-07 23:56:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:56:41,641 INFO L93 Difference]: Finished difference Result 1738 states and 2104 transitions.
[2024-11-07 23:56:41,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1738 states and 2104 transitions.
[2024-11-07 23:56:41,648 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 42
[2024-11-07 23:56:41,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1738 states to 1645 states and 2000 transitions.
[2024-11-07 23:56:41,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 749
[2024-11-07 23:56:41,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 749
[2024-11-07 23:56:41,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1645 states and 2000 transitions.
[2024-11-07 23:56:41,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:41,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1645 states and 2000 transitions.
[2024-11-07 23:56:41,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states and 2000 transitions.
[2024-11-07 23:56:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 846.
[2024-11-07 23:56:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 790 states have (on average 1.2240506329113925) internal successors, (967), 789 states have internal predecessors, (967), 37 states have call successors, (38), 27 states have call predecessors, (38), 19 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56)
[2024-11-07 23:56:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1061 transitions.
[2024-11-07 23:56:41,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 846 states and 1061 transitions.
[2024-11-07 23:56:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states.
[2024-11-07 23:56:41,679 INFO L425 stractBuchiCegarLoop]: Abstraction has 846 states and 1061 transitions.
[2024-11-07 23:56:41,679 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============
[2024-11-07 23:56:41,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 846 states and 1061 transitions.
[2024-11-07 23:56:41,682 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 20
[2024-11-07 23:56:41,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:41,682 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:41,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 3, 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]
[2024-11-07 23:56:41,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-07 23:56:41,683 INFO L745 eck$LassoCheckResult]: Stem: 31255#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 31201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31202#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 31206#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 31207#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31208#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 31209#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31270#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 31268#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31269#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 31271#L40-4 havoc main_~i~1#1; 31178#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 31179#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31398#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 31395#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 31396#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31399#L24 assume ~n#1 < 2; 31397#merge_sortFINAL assume true; 31394#merge_sortEXIT >#88#return; 31204#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 31393#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31391#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 31387#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 31388#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31392#L24 assume ~n#1 < 2; 31390#merge_sortFINAL assume true; 31386#merge_sortEXIT >#88#return; 31383#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 31384#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31389#L24 assume ~n#1 < 2; 31385#merge_sortFINAL assume true; 31382#merge_sortEXIT >#90#return; 31381#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 31380#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 31378#L12 assume !(merge_~j~0#1 == merge_~n#1); 31377#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 31376#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 31374#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 31373#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 31372#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 31371#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31368#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 31369#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 31571#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 31569#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31568#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 31567#L11-4 merge_~i~0#1 := 0; 31285#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 31286#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 31247#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 31248#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 31273#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 31274#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 31203#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 31205#merge_sortFINAL assume true; 31218#merge_sortEXIT >#90#return; 31219#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 31632#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 31633#L12 assume !(merge_~j~0#1 == merge_~n#1); 31921#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 31920#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 31917#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 31918#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 31947#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 31945#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31943#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 31903#L12 assume !(merge_~j~0#1 == merge_~n#1); 31902#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 31900#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 31897#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 31895#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 31894#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 31886#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31885#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 31883#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 31815#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 31630#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31628#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 31627#L11-4 merge_~i~0#1 := 0; 31240#L17-3
[2024-11-07 23:56:41,683 INFO L747 eck$LassoCheckResult]: Loop: 31240#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 31239#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 31240#L17-3
[2024-11-07 23:56:41,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1300508302, now seen corresponding path program 4 times
[2024-11-07 23:56:41,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:41,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605410907]
[2024-11-07 23:56:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:41,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:41,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:41,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:41,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 6 times
[2024-11-07 23:56:41,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:41,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262142594]
[2024-11-07 23:56:41,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:41,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:41,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:41,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:41,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash -47003312, now seen corresponding path program 5 times
[2024-11-07 23:56:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:41,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513649318]
[2024-11-07 23:56:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:41,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:56:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:56:41,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:56:49,281 INFO L204 LassoAnalysis]: Preferences:
[2024-11-07 23:56:49,281 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:56:49,281 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:56:49,281 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:56:49,281 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:56:49,281 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:49,281 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:56:49,281 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-07 23:56:49,281 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration25_Lasso
[2024-11-07 23:56:49,281 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:56:49,281 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:56:49,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:49,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:56:50,867 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:56:50,867 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:56:50,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:50,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:50,870 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:50,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process
[2024-11-07 23:56:50,872 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
[2024-11-07 23:56:50,882 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:50,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:50,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:50,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:50,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:50,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:50,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:50,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:50,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:50,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:50,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:50,896 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:50,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process
[2024-11-07 23:56:50,899 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
[2024-11-07 23:56:50,909 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:50,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:50,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:50,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:50,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:50,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:50,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:50,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:50,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:50,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:50,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:50,923 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:50,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process
[2024-11-07 23:56:50,925 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
[2024-11-07 23:56:50,936 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:50,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:50,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:50,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:50,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:50,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:50,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:50,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:50,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0
[2024-11-07 23:56:50,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:50,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:50,949 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:50,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process
[2024-11-07 23:56:50,950 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
[2024-11-07 23:56:50,959 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:50,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:50,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:50,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:50,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:50,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:50,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:50,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:50,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0
[2024-11-07 23:56:50,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:50,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:50,972 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:50,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process
[2024-11-07 23:56:50,974 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
[2024-11-07 23:56:50,983 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:50,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:50,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:50,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:50,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:50,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:50,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:50,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:50,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:50,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:50,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:50,997 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:50,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process
[2024-11-07 23:56:50,999 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
[2024-11-07 23:56:51,008 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:51,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:51,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:51,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0
[2024-11-07 23:56:51,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,021 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,023 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
[2024-11-07 23:56:51,032 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:51,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:51,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:51,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0
[2024-11-07 23:56:51,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,045 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,046 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
[2024-11-07 23:56:51,056 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:51,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:51,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:51,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0
[2024-11-07 23:56:51,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,069 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,070 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
[2024-11-07 23:56:51,079 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:51,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:51,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:51,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0
[2024-11-07 23:56:51,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,092 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,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
[2024-11-07 23:56:51,103 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:51,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:51,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:51,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0
[2024-11-07 23:56:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,116 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,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
[2024-11-07 23:56:51,129 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:51,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:51,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:51,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0
[2024-11-07 23:56:51,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,142 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,143 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
[2024-11-07 23:56:51,152 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:51,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:51,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:51,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0
[2024-11-07 23:56:51,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,166 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,167 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
[2024-11-07 23:56:51,176 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:51,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:51,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:51,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0
[2024-11-07 23:56:51,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,189 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,190 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
[2024-11-07 23:56:51,199 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:51,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:51,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:51,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0
[2024-11-07 23:56:51,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,212 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,214 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
[2024-11-07 23:56:51,223 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:56:51,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:56:51,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:56:51,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:51,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,241 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,242 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
[2024-11-07 23:56:51,251 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:51,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:51,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0
[2024-11-07 23:56:51,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,267 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,269 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
[2024-11-07 23:56:51,278 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:51,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:51,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:56:51,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0
[2024-11-07 23:56:51,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,293 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,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
[2024-11-07 23:56:51,304 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:56:51,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:56:51,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:56:51,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:56:51,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:56:51,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:56:51,322 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:56:51,341 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver.
[2024-11-07 23:56:51,341 INFO L444 ModelExtractionUtils]: 7 out of 31 variables were initially zero. Simplification set additionally 21 variables to zero.
[2024-11-07 23:56:51,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:56:51,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:51,343 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:56:51,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process
[2024-11-07 23:56:51,344 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:56:51,354 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-07 23:56:51,354 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-07 23:56:51,354 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~i~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~i~0#1 + 1*merge_sort_merge_~n#1
Supporting invariants []
[2024-11-07 23:56:51,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0
[2024-11-07 23:56:51,437 INFO L156 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed
[2024-11-07 23:56:51,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0
[2024-11-07 23:56:51,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:51,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:51,527 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:51,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:51,774 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:51,786 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates
[2024-11-07 23:56:51,786 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 846 states and 1061 transitions. cyclomatic complexity: 241 Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:51,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 846 states and 1061 transitions. cyclomatic complexity: 241. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 852 states and 1070 transitions. Complement of second has 7 states.
[2024-11-07 23:56:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-07 23:56:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions.
[2024-11-07 23:56:51,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 79 letters. Loop has 2 letters.
[2024-11-07 23:56:51,821 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:51,821 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-07 23:56:51,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:51,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:51,918 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:52,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:52,128 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:52,137 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates
[2024-11-07 23:56:52,137 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 846 states and 1061 transitions. cyclomatic complexity: 241 Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:52,171 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 846 states and 1061 transitions. cyclomatic complexity: 241. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 852 states and 1070 transitions. Complement of second has 7 states.
[2024-11-07 23:56:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-07 23:56:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions.
[2024-11-07 23:56:52,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 79 letters. Loop has 2 letters.
[2024-11-07 23:56:52,172 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:52,172 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-07 23:56:52,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:52,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:52,276 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:52,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:52,508 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:56:52,517 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates
[2024-11-07 23:56:52,517 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 846 states and 1061 transitions. cyclomatic complexity: 241 Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:52,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 846 states and 1061 transitions. cyclomatic complexity: 241. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 859 states and 1084 transitions. Complement of second has 9 states.
[2024-11-07 23:56:52,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-07 23:56:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 23:56:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions.
[2024-11-07 23:56:52,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 79 letters. Loop has 2 letters.
[2024-11-07 23:56:52,550 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:52,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 81 letters. Loop has 2 letters.
[2024-11-07 23:56:52,550 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:52,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 79 letters. Loop has 4 letters.
[2024-11-07 23:56:52,550 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:56:52,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 859 states and 1084 transitions.
[2024-11-07 23:56:52,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2024-11-07 23:56:52,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 859 states to 363 states and 460 transitions.
[2024-11-07 23:56:52,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170
[2024-11-07 23:56:52,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173
[2024-11-07 23:56:52,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 363 states and 460 transitions.
[2024-11-07 23:56:52,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:52,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 363 states and 460 transitions.
[2024-11-07 23:56:52,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states and 460 transitions.
[2024-11-07 23:56:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 336.
[2024-11-07 23:56:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 312 states have (on average 1.2467948717948718) internal successors, (389), 311 states have internal predecessors, (389), 16 states have call successors, (17), 13 states have call predecessors, (17), 8 states have return successors, (24), 11 states have call predecessors, (24), 12 states have call successors, (24)
[2024-11-07 23:56:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 430 transitions.
[2024-11-07 23:56:52,578 INFO L240 hiAutomatonCegarLoop]: Abstraction has 336 states and 430 transitions.
[2024-11-07 23:56:52,578 INFO L425 stractBuchiCegarLoop]: Abstraction has 336 states and 430 transitions.
[2024-11-07 23:56:52,578 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============
[2024-11-07 23:56:52,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 336 states and 430 transitions.
[2024-11-07 23:56:52,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2024-11-07 23:56:52,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:52,580 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:52,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:52,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
[2024-11-07 23:56:52,583 INFO L745 eck$LassoCheckResult]: Stem: 35529#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35485#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 35486#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 35489#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 35490#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 35491#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 35492#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 35542#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 35541#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 35540#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 35539#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 35537#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 35538#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 35551#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 35526#L40-4 havoc main_~i~1#1; 35504#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 35535#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35536#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 35475#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35505#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35511#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 35474#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35553#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35511#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 35474#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35553#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35578#L24 assume ~n#1 < 2; 35573#merge_sortFINAL assume true; 35569#merge_sortEXIT >#88#return; 35482#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35559#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35580#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 35499#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35503#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35582#L24 assume ~n#1 < 2; 35581#merge_sortFINAL assume true; 35498#merge_sortEXIT >#88#return; 35500#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35509#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35510#L24 assume ~n#1 < 2; 35501#merge_sortFINAL assume true; 35502#merge_sortEXIT >#90#return; 35544#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 35798#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35797#L12 assume !(merge_~j~0#1 == merge_~n#1); 35796#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 35795#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 35794#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 35793#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35792#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 35791#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35790#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35588#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 35587#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 35586#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35585#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 35584#L11-4 merge_~i~0#1 := 0; 35583#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 35563#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35562#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 35561#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 35560#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 35557#merge_sortFINAL assume true; 35556#merge_sortEXIT >#90#return; 35496#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 35497#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35745#L12 assume !(merge_~j~0#1 == merge_~n#1); 35746#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 35508#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 35473#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 35477#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35775#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 35774#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35732#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35674#L12 assume !(merge_~j~0#1 == merge_~n#1); 35675#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 35713#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35782#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 35780#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35777#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35776#L12 assume !(merge_~j~0#1 == merge_~n#1); 35594#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 35592#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35590#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 35547#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35545#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 35546#L11-4 merge_~i~0#1 := 0; 35630#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 35515#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35516#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 35520#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 35487#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 35488#merge_sortFINAL assume true; 35552#merge_sortEXIT >#88#return; 35468#L27-1
[2024-11-07 23:56:52,583 INFO L747 eck$LassoCheckResult]: Loop: 35468#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35517#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35555#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 35467#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35554#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35576#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 35467#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35554#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35576#L24 assume ~n#1 < 2; 35571#merge_sortFINAL assume true; 35564#merge_sortEXIT >#88#return; 35466#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35572#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35577#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 35566#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35570#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35575#L24 assume ~n#1 < 2; 35571#merge_sortFINAL assume true; 35564#merge_sortEXIT >#88#return; 35567#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35570#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35575#L24 assume ~n#1 < 2; 35571#merge_sortFINAL assume true; 35564#merge_sortEXIT >#90#return; 35568#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 35621#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35618#L12 assume !(merge_~j~0#1 == merge_~n#1); 35615#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 35612#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 35607#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 35603#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35599#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 35598#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35596#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35595#L12 assume !(merge_~j~0#1 == merge_~n#1); 35591#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 35589#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35587#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 35586#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35585#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 35584#L11-4 merge_~i~0#1 := 0; 35583#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 35563#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35562#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 35561#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 35560#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 35557#merge_sortFINAL assume true; 35556#merge_sortEXIT >#90#return; 35496#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 35497#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35745#L12 assume !(merge_~j~0#1 == merge_~n#1); 35746#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 35508#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 35473#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 35477#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35775#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 35774#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35732#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35674#L12 assume !(merge_~j~0#1 == merge_~n#1); 35675#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 35713#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35782#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 35780#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35777#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35776#L12 assume !(merge_~j~0#1 == merge_~n#1); 35594#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 35592#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35590#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 35547#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35545#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 35546#L11-4 merge_~i~0#1 := 0; 35630#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 35515#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35516#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 35520#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 35487#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 35488#merge_sortFINAL assume true; 35552#merge_sortEXIT >#88#return; 35468#L27-1
[2024-11-07 23:56:52,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 54237288, now seen corresponding path program 2 times
[2024-11-07 23:56:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:52,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804883543]
[2024-11-07 23:56:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:52,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 23:56:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-07 23:56:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-07 23:56:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-07 23:56:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-07 23:56:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 58 proven. 55 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2024-11-07 23:56:53,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:56:53,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804883543]
[2024-11-07 23:56:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804883543] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:56:53,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838165157]
[2024-11-07 23:56:53,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 23:56:53,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:56:53,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:53,073 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:56:53,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (207)] Waiting until timeout for monitored process
[2024-11-07 23:56:53,276 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-07 23:56:53,276 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:53,279 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked.
[2024-11-07 23:56:53,344 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:56:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked.
[2024-11-07 23:56:53,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838165157] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:56:53,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:56:53,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 25
[2024-11-07 23:56:53,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816886026]
[2024-11-07 23:56:53,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:56:53,441 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-07 23:56:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -211580309, now seen corresponding path program 1 times
[2024-11-07 23:56:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20154980]
[2024-11-07 23:56:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:53,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 23:56:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-07 23:56:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-07 23:56:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-07 23:56:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-07 23:56:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 69 proven. 8 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2024-11-07 23:56:53,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:56:53,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20154980]
[2024-11-07 23:56:53,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20154980] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:56:53,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017282766]
[2024-11-07 23:56:53,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:53,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:56:53,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:53,655 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:56:53,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (208)] Waiting until timeout for monitored process
[2024-11-07 23:56:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:53,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:53,858 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 67 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2024-11-07 23:56:53,916 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 23:56:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 67 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2024-11-07 23:56:54,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017282766] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 23:56:54,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 23:56:54,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12
[2024-11-07 23:56:54,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794865342]
[2024-11-07 23:56:54,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 23:56:54,041 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-07 23:56:54,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:56:54,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-07 23:56:54,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2024-11-07 23:56:54,042 INFO L87 Difference]: Start difference. First operand 336 states and 430 transitions. cyclomatic complexity: 106 Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6)
[2024-11-07 23:56:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:56:54,231 INFO L93 Difference]: Finished difference Result 510 states and 654 transitions.
[2024-11-07 23:56:54,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 510 states and 654 transitions.
[2024-11-07 23:56:54,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2024-11-07 23:56:54,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 510 states to 510 states and 654 transitions.
[2024-11-07 23:56:54,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207
[2024-11-07 23:56:54,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207
[2024-11-07 23:56:54,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 510 states and 654 transitions.
[2024-11-07 23:56:54,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:56:54,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 510 states and 654 transitions.
[2024-11-07 23:56:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states and 654 transitions.
[2024-11-07 23:56:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 342.
[2024-11-07 23:56:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 318 states have (on average 1.2421383647798743) internal successors, (395), 317 states have internal predecessors, (395), 16 states have call successors, (17), 13 states have call predecessors, (17), 8 states have return successors, (24), 11 states have call predecessors, (24), 12 states have call successors, (24)
[2024-11-07 23:56:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 436 transitions.
[2024-11-07 23:56:54,247 INFO L240 hiAutomatonCegarLoop]: Abstraction has 342 states and 436 transitions.
[2024-11-07 23:56:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-11-07 23:56:54,248 INFO L425 stractBuchiCegarLoop]: Abstraction has 342 states and 436 transitions.
[2024-11-07 23:56:54,248 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============
[2024-11-07 23:56:54,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 436 transitions.
[2024-11-07 23:56:54,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2024-11-07 23:56:54,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:56:54,249 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:56:54,250 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:56:54,250 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 10, 10, 10, 10, 9, 8, 8, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4]
[2024-11-07 23:56:54,251 INFO L745 eck$LassoCheckResult]: Stem: 37689#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37641#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 37642#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 37647#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 37648#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 37649#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 37650#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 37651#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 37705#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 37704#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 37703#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 37701#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 37702#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 37693#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 37694#L40-4 havoc main_~i~1#1; 37621#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 37622#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37717#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 37624#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37669#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37670#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 37626#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37665#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37670#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 37626#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37665#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37714#L24 assume ~n#1 < 2; 37726#merge_sortFINAL assume true; 37727#merge_sortEXIT >#88#return; 37645#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 37730#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37729#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 37659#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37728#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37733#L24 assume ~n#1 < 2; 37732#merge_sortFINAL assume true; 37658#merge_sortEXIT >#88#return; 37660#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 37667#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37668#L24 assume ~n#1 < 2; 37661#merge_sortFINAL assume true; 37662#merge_sortEXIT >#90#return; 37711#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 37774#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37769#L12 assume !(merge_~j~0#1 == merge_~n#1); 37770#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 37765#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 37766#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 37760#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37761#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37756#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37757#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37752#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 37751#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37750#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37749#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 37748#L11-4 merge_~i~0#1 := 0; 37747#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37746#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37745#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37743#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37742#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 37741#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 37643#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 37646#merge_sortFINAL assume true; 37725#merge_sortEXIT >#90#return; 37656#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 37657#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37652#L12 assume !(merge_~j~0#1 == merge_~n#1); 37637#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 37638#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 37892#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 37890#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37888#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37886#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37884#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37881#L12 assume !(merge_~j~0#1 == merge_~n#1); 37882#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 37895#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37918#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37916#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37914#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37912#L12 assume !(merge_~j~0#1 == merge_~n#1); 37805#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 37631#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37798#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37797#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37796#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 37786#L11-4 merge_~i~0#1 := 0; 37679#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37680#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37681#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37682#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37700#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 37635#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 37636#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 37720#merge_sortFINAL assume true; 37721#merge_sortEXIT >#88#return; 37630#L27-1
[2024-11-07 23:56:54,252 INFO L747 eck$LassoCheckResult]: Loop: 37630#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 37678#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37724#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 37625#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37722#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37734#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 37625#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37722#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37734#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 37625#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37722#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37734#L24 assume ~n#1 < 2; 37740#merge_sortFINAL assume true; 37737#merge_sortEXIT >#88#return; 37644#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 37712#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37713#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 37663#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37664#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37744#L24 assume ~n#1 < 2; 37740#merge_sortFINAL assume true; 37737#merge_sortEXIT >#88#return; 37738#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 37664#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37744#L24 assume ~n#1 < 2; 37740#merge_sortFINAL assume true; 37737#merge_sortEXIT >#90#return; 37739#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 37772#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37773#L12 assume !(merge_~j~0#1 == merge_~n#1); 37771#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 37785#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 37784#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 37783#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37782#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37781#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37780#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37778#L12 assume !(merge_~j~0#1 == merge_~n#1); 37776#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 37753#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37751#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37750#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37749#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 37748#L11-4 merge_~i~0#1 := 0; 37747#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37746#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37745#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37743#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37742#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 37741#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 37643#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 37646#merge_sortFINAL assume true; 37725#merge_sortEXIT >#90#return; 37656#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 37657#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37652#L12 assume !(merge_~j~0#1 == merge_~n#1); 37637#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 37638#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 37892#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 37890#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37888#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37886#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37884#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37881#L12 assume !(merge_~j~0#1 == merge_~n#1); 37882#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 37895#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37918#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37916#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37914#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37912#L12 assume !(merge_~j~0#1 == merge_~n#1); 37805#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 37631#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37798#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37797#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37796#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 37786#L11-4 merge_~i~0#1 := 0; 37679#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37680#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37681#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37682#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37700#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 37635#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 37636#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 37720#merge_sortFINAL assume true; 37721#merge_sortEXIT >#88#return; 37630#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 37678#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37724#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 37625#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37722#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37734#L24 assume ~n#1 < 2; 37740#merge_sortFINAL assume true; 37737#merge_sortEXIT >#88#return; 37644#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 37712#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37713#L24 assume ~n#1 < 2; 37740#merge_sortFINAL assume true; 37737#merge_sortEXIT >#90#return; 37739#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 37772#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37773#L12 assume !(merge_~j~0#1 == merge_~n#1); 37771#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 37785#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 37784#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 37783#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37782#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37781#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37780#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37778#L12 assume !(merge_~j~0#1 == merge_~n#1); 37776#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 37753#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37751#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37750#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37749#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 37748#L11-4 merge_~i~0#1 := 0; 37747#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37746#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37745#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37743#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37742#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 37741#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 37643#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 37646#merge_sortFINAL assume true; 37725#merge_sortEXIT >#90#return; 37716#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 37794#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37795#L12 assume !(merge_~j~0#1 == merge_~n#1); 37847#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 37846#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 37844#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 37842#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37840#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37838#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37836#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37833#L12 assume !(merge_~j~0#1 == merge_~n#1); 37831#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 37829#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37827#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37825#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37822#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37818#L12 assume !(merge_~j~0#1 == merge_~n#1); 37808#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 37799#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37692#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 37685#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37671#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 37672#L11-4 merge_~i~0#1 := 0; 37687#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37675#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37676#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 37698#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37696#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 37697#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 37735#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 37736#merge_sortFINAL assume true; 37715#merge_sortEXIT >#88#return; 37630#L27-1
[2024-11-07 23:56:54,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:56:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1994875868, now seen corresponding path program 3 times
[2024-11-07 23:56:54,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:56:54,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761809511]
[2024-11-07 23:56:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:56:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:56:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:54,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 23:56:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:54,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-07 23:56:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:54,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-07 23:56:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:54,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-07 23:56:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-07 23:56:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:56:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2024-11-07 23:56:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:56:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761809511]
[2024-11-07 23:56:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761809511] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 23:56:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576806322]
[2024-11-07 23:56:54,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 23:56:54,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 23:56:54,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:56:54,794 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 23:56:54,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (209)] Waiting until timeout for monitored process
[2024-11-07 23:56:55,086 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2024-11-07 23:56:55,086 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 23:56:55,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-07 23:56:55,090 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:56:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 70 proven. 17 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked.
[2024-11-07 23:56:55,243 INFO L311 TraceCheckSpWp]: Computing backward predicates...